./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.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-79.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 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:46:16,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:46:16,653 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:46:16,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:46:16,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:46:16,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:46:16,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:46:16,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:46:16,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:46:16,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:46:16,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:46:16,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:46:16,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:46:16,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:46:16,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:46:16,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:46:16,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:16,672 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:46:16,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:16,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:46:16,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:46:16,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:46:16,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:46:16,674 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 -> 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 [2025-01-09 12:46:16,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:46:16,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:46:16,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:46:16,851 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:46:16,851 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:46:16,852 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-79.i [2025-01-09 12:46:18,014 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bde1830/eaff4ae5f4f2423bb5818a52c0a52b84/FLAG280ea1d39 [2025-01-09 12:46:18,250 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:46:18,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2025-01-09 12:46:18,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bde1830/eaff4ae5f4f2423bb5818a52c0a52b84/FLAG280ea1d39 [2025-01-09 12:46:18,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28bde1830/eaff4ae5f4f2423bb5818a52c0a52b84 [2025-01-09 12:46:18,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:46:18,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:46:18,584 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:18,584 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:46:18,587 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:46:18,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c851df9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18, skipping insertion in model container [2025-01-09 12:46:18,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:46:18,688 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-79.i[916,929] [2025-01-09 12:46:18,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:18,727 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:46:18,734 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-79.i[916,929] [2025-01-09 12:46:18,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:18,763 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:46:18,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18 WrapperNode [2025-01-09 12:46:18,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:18,765 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:18,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:46:18,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:46:18,769 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:46:18" (1/1) ... [2025-01-09 12:46:18,774 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:46:18" (1/1) ... [2025-01-09 12:46:18,793 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-01-09 12:46:18,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:18,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:46:18,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:46:18,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:46:18,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,817 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:46:18,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,822 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,824 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:46:18,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:46:18,837 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:46:18,837 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:46:18,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (1/1) ... [2025-01-09 12:46:18,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:18,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:18,863 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:46:18,865 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:46:18,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:46:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:46:18,885 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:46:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:46:18,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:46:18,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:46:18,937 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:46:18,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:46:19,098 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 12:46:19,098 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:46:19,107 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:46:19,107 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:46:19,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:19 BoogieIcfgContainer [2025-01-09 12:46:19,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:46:19,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:46:19,112 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:46:19,119 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:46:19,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:46:18" (1/3) ... [2025-01-09 12:46:19,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbec7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:19, skipping insertion in model container [2025-01-09 12:46:19,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:18" (2/3) ... [2025-01-09 12:46:19,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fbec7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:19, skipping insertion in model container [2025-01-09 12:46:19,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:19" (3/3) ... [2025-01-09 12:46:19,120 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2025-01-09 12:46:19,129 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:46:19,130 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-79.i that has 2 procedures, 54 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:46:19,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:46:19,177 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;@5aa25444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:46:19,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:46:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 12:46:19,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:19,186 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:19,187 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:19,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:19,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1359402758, now seen corresponding path program 1 times [2025-01-09 12:46:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:19,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262543235] [2025-01-09 12:46:19,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:19,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 12:46:19,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 12:46:19,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:19,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 12:46:19,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:19,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262543235] [2025-01-09 12:46:19,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262543235] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:46:19,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602488623] [2025-01-09 12:46:19,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:19,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:19,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:19,392 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:46:19,394 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:46:19,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 12:46:19,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 12:46:19,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:19,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:19,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:46:19,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 12:46:19,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:19,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602488623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:19,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:46:19,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:46:19,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799910822] [2025-01-09 12:46:19,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:19,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:46:19,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:19,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:46:19,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:19,538 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:46:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:19,555 INFO L93 Difference]: Finished difference Result 102 states and 165 transitions. [2025-01-09 12:46:19,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:46:19,556 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2025-01-09 12:46:19,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:19,560 INFO L225 Difference]: With dead ends: 102 [2025-01-09 12:46:19,560 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 12:46:19,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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:46:19,565 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:19,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:19,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 12:46:19,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 12:46:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2025-01-09 12:46:19,597 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 94 [2025-01-09 12:46:19,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:19,598 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2025-01-09 12:46:19,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:46:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2025-01-09 12:46:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 12:46:19,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:19,603 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:19,610 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:46:19,803 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:46:19,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:19,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1655790138, now seen corresponding path program 1 times [2025-01-09 12:46:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:19,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787518311] [2025-01-09 12:46:19,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:19,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 12:46:19,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 12:46:19,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:19,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:20,269 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:46:20,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787518311] [2025-01-09 12:46:20,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787518311] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:20,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:20,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:46:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298006955] [2025-01-09 12:46:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:20,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:46:20,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:20,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:46:20,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:46:20,271 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:20,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:20,349 INFO L93 Difference]: Finished difference Result 145 states and 209 transitions. [2025-01-09 12:46:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:46:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-01-09 12:46:20,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:20,351 INFO L225 Difference]: With dead ends: 145 [2025-01-09 12:46:20,351 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 12:46:20,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:46:20,352 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:20,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 439 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 12:46:20,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 53. [2025-01-09 12:46:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2025-01-09 12:46:20,359 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 94 [2025-01-09 12:46:20,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:20,360 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2025-01-09 12:46:20,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2025-01-09 12:46:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 12:46:20,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:20,361 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:20,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:46:20,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:20,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:20,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1155852875, now seen corresponding path program 1 times [2025-01-09 12:46:20,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:20,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147070645] [2025-01-09 12:46:20,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:20,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 12:46:20,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 12:46:20,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:20,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:46:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147070645] [2025-01-09 12:46:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147070645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 12:46:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156895959] [2025-01-09 12:46:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:20,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 12:46:20,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:20,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 12:46:20,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:46:20,710 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:20,866 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2025-01-09 12:46:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:46:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2025-01-09 12:46:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:20,867 INFO L225 Difference]: With dead ends: 149 [2025-01-09 12:46:20,867 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 12:46:20,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 12:46:20,868 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 67 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:20,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 390 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 12:46:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2025-01-09 12:46:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2025-01-09 12:46:20,878 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 95 [2025-01-09 12:46:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:20,879 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2025-01-09 12:46:20,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:20,879 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2025-01-09 12:46:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 12:46:20,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:20,881 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:20,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:46:20,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:20,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:20,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1670087873, now seen corresponding path program 1 times [2025-01-09 12:46:20,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:20,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592987688] [2025-01-09 12:46:20,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:20,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:20,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 12:46:20,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 12:46:20,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:20,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:46:21,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:21,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592987688] [2025-01-09 12:46:21,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592987688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:21,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:21,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:46:21,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075668185] [2025-01-09 12:46:21,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:21,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:46:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:21,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:46:21,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:46:21,220 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:21,342 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2025-01-09 12:46:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:46:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2025-01-09 12:46:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:21,344 INFO L225 Difference]: With dead ends: 105 [2025-01-09 12:46:21,346 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 12:46:21,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:46:21,347 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 47 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:21,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 136 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:21,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 12:46:21,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2025-01-09 12:46:21,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2025-01-09 12:46:21,359 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 96 [2025-01-09 12:46:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:21,359 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-01-09 12:46:21,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2025-01-09 12:46:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 12:46:21,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:21,361 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:21,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:46:21,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:21,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2124594182, now seen corresponding path program 1 times [2025-01-09 12:46:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:21,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312235426] [2025-01-09 12:46:21,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:21,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 12:46:21,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 12:46:21,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:21,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:46:21,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403969538] [2025-01-09 12:46:21,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:21,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:21,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:21,416 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:46:21,419 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:46:21,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 12:46:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 12:46:21,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:21,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:21,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 12:46:21,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:46:22,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312235426] [2025-01-09 12:46:22,225 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:46:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403969538] [2025-01-09 12:46:22,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403969538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:22,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:22,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 12:46:22,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215127705] [2025-01-09 12:46:22,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:22,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 12:46:22,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:22,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 12:46:22,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:46:22,227 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:22,643 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2025-01-09 12:46:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 12:46:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-01-09 12:46:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:22,645 INFO L225 Difference]: With dead ends: 97 [2025-01-09 12:46:22,645 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 12:46:22,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:46:22,646 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:22,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 254 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:46:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 12:46:22,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2025-01-09 12:46:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2025-01-09 12:46:22,652 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 97 [2025-01-09 12:46:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:22,652 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2025-01-09 12:46:22,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:22,652 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2025-01-09 12:46:22,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 12:46:22,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:22,653 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:22,660 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:46:22,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:22,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:22,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash 591384856, now seen corresponding path program 1 times [2025-01-09 12:46:22,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263749072] [2025-01-09 12:46:22,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:22,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:22,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:22,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:22,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:46:23,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263749072] [2025-01-09 12:46:23,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263749072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:46:23,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020959629] [2025-01-09 12:46:23,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:23,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:23,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:23,051 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:23,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:46:23,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:23,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:23,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:23,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:23,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 12:46:23,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:23,192 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 12:46:23,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:46:23,400 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:46:23,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020959629] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:46:23,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:46:23,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 12:46:23,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806753689] [2025-01-09 12:46:23,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:46:23,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:46:23,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:23,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:46:23,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:46:23,402 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:46:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:23,694 INFO L93 Difference]: Finished difference Result 184 states and 234 transitions. [2025-01-09 12:46:23,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:46:23,694 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 98 [2025-01-09 12:46:23,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:23,695 INFO L225 Difference]: With dead ends: 184 [2025-01-09 12:46:23,695 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 12:46:23,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:46:23,696 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 138 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:23,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 278 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:46:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 12:46:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2025-01-09 12:46:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 76 states have internal predecessors, (88), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:46:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2025-01-09 12:46:23,709 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 98 [2025-01-09 12:46:23,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:23,709 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2025-01-09 12:46:23,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:46:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2025-01-09 12:46:23,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 12:46:23,711 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:23,711 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:23,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:46:23,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:23,912 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:23,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:23,912 INFO L85 PathProgramCache]: Analyzing trace with hash 849550294, now seen corresponding path program 1 times [2025-01-09 12:46:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:23,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229800121] [2025-01-09 12:46:23,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:23,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:23,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:23,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:23,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:23,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:46:23,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807375271] [2025-01-09 12:46:23,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:23,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:23,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:23,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:23,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 12:46:23,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:24,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:24,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:24,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:24,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 12:46:24,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 12:46:24,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:24,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:24,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229800121] [2025-01-09 12:46:24,614 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:46:24,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807375271] [2025-01-09 12:46:24,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807375271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:24,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:24,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:46:24,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176920665] [2025-01-09 12:46:24,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:24,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:46:24,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:24,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:46:24,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:46:24,617 INFO L87 Difference]: Start difference. First operand 98 states and 124 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:46:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:25,153 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2025-01-09 12:46:25,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 12:46:25,153 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2025-01-09 12:46:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:25,155 INFO L225 Difference]: With dead ends: 133 [2025-01-09 12:46:25,155 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 12:46:25,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2025-01-09 12:46:25,156 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 141 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:25,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 268 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:46:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 12:46:25,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 99. [2025-01-09 12:46:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 77 states have internal predecessors, (89), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:46:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2025-01-09 12:46:25,170 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 98 [2025-01-09 12:46:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:25,170 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2025-01-09 12:46:25,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:46:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2025-01-09 12:46:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 12:46:25,172 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:25,172 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:25,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 12:46:25,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 12:46:25,373 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:25,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:25,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1143064545, now seen corresponding path program 1 times [2025-01-09 12:46:25,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:25,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404069713] [2025-01-09 12:46:25,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:25,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:25,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:25,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:25,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:25,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:46:25,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:25,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404069713] [2025-01-09 12:46:25,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404069713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:25,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:25,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:46:25,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479003345] [2025-01-09 12:46:25,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:25,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:46:25,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:25,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:46:25,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:25,426 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:25,451 INFO L93 Difference]: Finished difference Result 228 states and 287 transitions. [2025-01-09 12:46:25,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:46:25,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 12:46:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:25,452 INFO L225 Difference]: With dead ends: 228 [2025-01-09 12:46:25,452 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 12:46:25,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:25,453 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:25,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 119 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 12:46:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 118. [2025-01-09 12:46:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.168421052631579) internal successors, (111), 96 states have internal predecessors, (111), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:46:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 147 transitions. [2025-01-09 12:46:25,469 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 147 transitions. Word has length 98 [2025-01-09 12:46:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:25,469 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 147 transitions. [2025-01-09 12:46:25,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 147 transitions. [2025-01-09 12:46:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 12:46:25,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:25,470 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:25,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:46:25,470 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -2109529329, now seen corresponding path program 1 times [2025-01-09 12:46:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:25,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083024487] [2025-01-09 12:46:25,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:25,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:25,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:25,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:25,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:25,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:46:25,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102145621] [2025-01-09 12:46:25,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:25,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:25,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:25,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 12:46:25,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:25,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:25,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:25,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:25,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 12:46:25,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:46:26,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:26,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083024487] [2025-01-09 12:46:26,431 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:46:26,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102145621] [2025-01-09 12:46:26,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102145621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:26,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:26,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:46:26,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052806246] [2025-01-09 12:46:26,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:26,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:46:26,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:26,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:46:26,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:46:26,432 INFO L87 Difference]: Start difference. First operand 118 states and 147 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:27,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:27,481 INFO L93 Difference]: Finished difference Result 150 states and 179 transitions. [2025-01-09 12:46:27,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 12:46:27,481 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 12:46:27,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:27,483 INFO L225 Difference]: With dead ends: 150 [2025-01-09 12:46:27,483 INFO L226 Difference]: Without dead ends: 148 [2025-01-09 12:46:27,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-01-09 12:46:27,484 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 95 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:27,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 373 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:46:27,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-01-09 12:46:27,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2025-01-09 12:46:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 106 states have internal predecessors, (121), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:46:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 157 transitions. [2025-01-09 12:46:27,494 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 157 transitions. Word has length 98 [2025-01-09 12:46:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:27,494 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 157 transitions. [2025-01-09 12:46:27,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 157 transitions. [2025-01-09 12:46:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 12:46:27,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:27,495 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:27,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 12:46:27,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:27,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:27,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:27,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1174320717, now seen corresponding path program 1 times [2025-01-09 12:46:27,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:27,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539716777] [2025-01-09 12:46:27,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:27,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:27,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:27,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:27,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:46:28,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:28,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539716777] [2025-01-09 12:46:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539716777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:28,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:28,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 12:46:28,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429320156] [2025-01-09 12:46:28,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:28,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:46:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:28,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:46:28,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:46:28,103 INFO L87 Difference]: Start difference. First operand 128 states and 157 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:28,262 INFO L93 Difference]: Finished difference Result 189 states and 227 transitions. [2025-01-09 12:46:28,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 12:46:28,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 12:46:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:28,263 INFO L225 Difference]: With dead ends: 189 [2025-01-09 12:46:28,264 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 12:46:28,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 12:46:28,265 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 65 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:28,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 432 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 12:46:28,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 137. [2025-01-09 12:46:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 114 states have (on average 1.1578947368421053) internal successors, (132), 115 states have internal predecessors, (132), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:46:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2025-01-09 12:46:28,274 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 98 [2025-01-09 12:46:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:28,274 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2025-01-09 12:46:28,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2025-01-09 12:46:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 12:46:28,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:28,275 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:28,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:46:28,275 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:28,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:28,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1196303844, now seen corresponding path program 1 times [2025-01-09 12:46:28,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:28,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077007844] [2025-01-09 12:46:28,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:28,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:28,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 12:46:28,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 12:46:28,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:28,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:46:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:28,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077007844] [2025-01-09 12:46:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077007844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:28,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:28,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:46:28,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433849878] [2025-01-09 12:46:28,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:28,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:46:28,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:28,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:46:28,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:28,314 INFO L87 Difference]: Start difference. First operand 137 states and 168 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:28,337 INFO L93 Difference]: Finished difference Result 289 states and 352 transitions. [2025-01-09 12:46:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:46:28,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 12:46:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:28,339 INFO L225 Difference]: With dead ends: 289 [2025-01-09 12:46:28,339 INFO L226 Difference]: Without dead ends: 155 [2025-01-09 12:46:28,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:46:28,340 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 15 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:28,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-01-09 12:46:28,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 137. [2025-01-09 12:46:28,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 114 states have (on average 1.131578947368421) internal successors, (129), 115 states have internal predecessors, (129), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:46:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2025-01-09 12:46:28,347 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 98 [2025-01-09 12:46:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:28,348 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2025-01-09 12:46:28,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2025-01-09 12:46:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 12:46:28,348 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:28,349 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:28,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:46:28,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:28,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1817425105, now seen corresponding path program 1 times [2025-01-09 12:46:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:28,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018279730] [2025-01-09 12:46:28,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:28,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:28,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:28,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:28,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:46:28,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958542433] [2025-01-09 12:46:28,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:28,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:28,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:28,367 INFO L229 MonitoredProcess]: Starting monitored process 7 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:46:28,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 12:46:28,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:28,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:28,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:28,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:28,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-01-09 12:46:28,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 243 proven. 27 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-09 12:46:29,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:46:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:46:31,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:31,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018279730] [2025-01-09 12:46:31,308 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:46:31,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958542433] [2025-01-09 12:46:31,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958542433] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 12:46:31,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:46:31,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [21] total 36 [2025-01-09 12:46:31,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851508975] [2025-01-09 12:46:31,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:46:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:31,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:46:31,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 12:46:31,309 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:33,560 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2025-01-09 12:46:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 12:46:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-01-09 12:46:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:33,562 INFO L225 Difference]: With dead ends: 185 [2025-01-09 12:46:33,562 INFO L226 Difference]: Without dead ends: 183 [2025-01-09 12:46:33,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=417, Invalid=1745, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 12:46:33,563 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 117 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:33,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 449 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:46:33,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-01-09 12:46:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2025-01-09 12:46:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.1153846153846154) internal successors, (145), 132 states have internal predecessors, (145), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:46:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 185 transitions. [2025-01-09 12:46:33,581 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 185 transitions. Word has length 99 [2025-01-09 12:46:33,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:33,582 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 185 transitions. [2025-01-09 12:46:33,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 15 states have internal predecessors, (35), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 185 transitions. [2025-01-09 12:46:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 12:46:33,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:33,584 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:33,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 12:46:33,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 12:46:33,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:33,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:33,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1559259667, now seen corresponding path program 1 times [2025-01-09 12:46:33,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:33,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382023860] [2025-01-09 12:46:33,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:33,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:33,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:33,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:33,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:33,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:46:33,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821983987] [2025-01-09 12:46:33,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:33,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:33,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:33,811 INFO L229 MonitoredProcess]: Starting monitored process 8 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:46:33,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 12:46:33,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:33,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:33,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:33,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:33,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 12:46:33,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-01-09 12:46:34,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:34,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382023860] [2025-01-09 12:46:34,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:46:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821983987] [2025-01-09 12:46:34,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821983987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:34,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:34,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:46:34,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613007242] [2025-01-09 12:46:34,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:34,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:46:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:34,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:46:34,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:46:34,610 INFO L87 Difference]: Start difference. First operand 156 states and 185 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:46:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:35,280 INFO L93 Difference]: Finished difference Result 188 states and 217 transitions. [2025-01-09 12:46:35,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 12:46:35,281 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2025-01-09 12:46:35,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:35,282 INFO L225 Difference]: With dead ends: 188 [2025-01-09 12:46:35,282 INFO L226 Difference]: Without dead ends: 186 [2025-01-09 12:46:35,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2025-01-09 12:46:35,283 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 107 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:35,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 300 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:46:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-01-09 12:46:35,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 150. [2025-01-09 12:46:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.1209677419354838) internal successors, (139), 126 states have internal predecessors, (139), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:46:35,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 179 transitions. [2025-01-09 12:46:35,291 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 179 transitions. Word has length 99 [2025-01-09 12:46:35,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:35,291 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 179 transitions. [2025-01-09 12:46:35,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:46:35,291 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 179 transitions. [2025-01-09 12:46:35,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 12:46:35,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:35,292 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 12:46:35,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:35,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:35,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:35,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1455843951, now seen corresponding path program 1 times [2025-01-09 12:46:35,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:35,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254820263] [2025-01-09 12:46:35,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:35,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:35,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:35,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:35,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:46:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:46:35,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254820263] [2025-01-09 12:46:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254820263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:35,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:35,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 12:46:35,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112030957] [2025-01-09 12:46:35,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:35,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:46:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:46:35,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:46:35,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 12:46:35,902 INFO L87 Difference]: Start difference. First operand 150 states and 179 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:36,104 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2025-01-09 12:46:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:46:36,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2025-01-09 12:46:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:36,105 INFO L225 Difference]: With dead ends: 200 [2025-01-09 12:46:36,105 INFO L226 Difference]: Without dead ends: 198 [2025-01-09 12:46:36,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:46:36,106 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 62 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:36,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 552 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:46:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-01-09 12:46:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 142. [2025-01-09 12:46:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 116 states have (on average 1.1206896551724137) internal successors, (130), 118 states have internal predecessors, (130), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 12:46:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 170 transitions. [2025-01-09 12:46:36,114 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 170 transitions. Word has length 99 [2025-01-09 12:46:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:36,115 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 170 transitions. [2025-01-09 12:46:36,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 170 transitions. [2025-01-09 12:46:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 12:46:36,115 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:36,115 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:36,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 12:46:36,116 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:36,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 144706049, now seen corresponding path program 1 times [2025-01-09 12:46:36,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:46:36,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522573950] [2025-01-09 12:46:36,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:46:36,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:36,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:36,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:36,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:46:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499190039] [2025-01-09 12:46:36,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:36,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:36,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:36,141 INFO L229 MonitoredProcess]: Starting monitored process 9 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:46:36,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 12:46:36,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:36,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:36,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:36,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:46:36,188 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:46:36,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 12:46:36,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 12:46:36,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:36,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:46:36,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:46:36,253 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:46:36,254 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:46:36,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 12:46:36,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 12:46:36,458 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:46:36,516 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:46:36,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:46:36 BoogieIcfgContainer [2025-01-09 12:46:36,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:46:36,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:46:36,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:46:36,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:46:36,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:19" (3/4) ... [2025-01-09 12:46:36,525 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:46:36,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:46:36,527 INFO L158 Benchmark]: Toolchain (without parser) took 17943.40ms. Allocated memory was 201.3MB in the beginning and 394.3MB in the end (delta: 192.9MB). Free memory was 159.0MB in the beginning and 353.6MB in the end (delta: -194.7MB). Peak memory consumption was 1.2MB. Max. memory is 16.1GB. [2025-01-09 12:46:36,527 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 218.1MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:36,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.89ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 146.7MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:46:36,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.80ms. Allocated memory is still 201.3MB. Free memory was 146.7MB in the beginning and 144.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:46:36,528 INFO L158 Benchmark]: Boogie Preprocessor took 43.21ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 142.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:46:36,529 INFO L158 Benchmark]: RCFGBuilder took 270.62ms. Allocated memory is still 201.3MB. Free memory was 142.7MB in the beginning and 126.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:46:36,529 INFO L158 Benchmark]: TraceAbstraction took 17410.73ms. Allocated memory was 201.3MB in the beginning and 394.3MB in the end (delta: 192.9MB). Free memory was 125.9MB in the beginning and 353.7MB in the end (delta: -227.8MB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. [2025-01-09 12:46:36,529 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 394.3MB. Free memory was 353.7MB in the beginning and 353.6MB in the end (delta: 81.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:46:36,530 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 218.1MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.89ms. Allocated memory is still 201.3MB. Free memory was 159.0MB in the beginning and 146.7MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.80ms. Allocated memory is still 201.3MB. Free memory was 146.7MB in the beginning and 144.6MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.21ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 142.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 270.62ms. Allocated memory is still 201.3MB. Free memory was 142.7MB in the beginning and 126.6MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17410.73ms. Allocated memory was 201.3MB in the beginning and 394.3MB in the end (delta: 192.9MB). Free memory was 125.9MB in the beginning and 353.7MB in the end (delta: -227.8MB). Peak memory consumption was 185.8MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 394.3MB. Free memory was 353.7MB in the beginning and 353.6MB in the end (delta: 81.1kB). Peak memory consumption was 8.4MB. 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 shiftRight at line 91, overapproximation of shiftRight at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed char var_1_3 = 0; [L24] signed char var_1_4 = 64; [L25] signed char var_1_5 = 64; [L26] signed long int var_1_6 = -64; [L27] signed long int var_1_8 = 32; [L28] signed long int var_1_9 = 1; [L29] unsigned short int var_1_10 = 32; [L30] signed long int var_1_11 = 15; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int last_1_var_1_10 = 32; VAL [isInitial=0, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L95] isInitial = 1 [L96] FCALL initially() [L98] CALL updateLastVariables() [L88] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L66] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L67] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L68] var_1_4 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L69] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L70] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L74] var_1_8 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L75] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L76] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L80] var_1_11 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L81] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L82] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L82] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L85] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L85] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L99] RET updateVariables() [L100] CALL step() [L37] signed long int stepLocal_0 = (((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L38] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L38] COND FALSE !(stepLocal_0 <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) [L45] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L47] signed long int stepLocal_1 = var_1_5 + var_1_6; VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L48] COND FALSE !(var_1_11 < var_1_9) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L56] COND TRUE ! var_1_12 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L57] COND TRUE ! var_1_12 [L58] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91-L92] return ((((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5)))) && ((var_1_11 < var_1_9) ? (((var_1_5 + var_1_6) <= (~ (var_1_6 % -32))) ? (var_1_10 == ((unsigned short int) var_1_5)) : (var_1_10 == ((unsigned short int) var_1_5))) : 1)) && (var_1_12 == ((unsigned char) var_1_13)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.3s, OverallIterations: 15, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1094 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1026 mSDsluCounter, 4204 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3214 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4069 IncrementalHoareTripleChecker+Invalid, 4168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 990 mSDtfsCounter, 4069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 990 GetRequests, 806 SyntacticMatches, 1 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=12, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 395 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 2242 NumberOfCodeBlocks, 2242 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1732 ConstructedInterpolants, 2 QuantifiedInterpolants, 7680 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1609 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 6418/6552 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:46:36,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.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 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:46:38,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:46:38,514 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:46:38,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:46:38,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:46:38,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:46:38,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:46:38,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:46:38,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:46:38,533 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:46:38,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:46:38,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:46:38,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:46:38,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:46:38,534 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:46:38,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:46:38,534 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:46:38,534 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:46:38,534 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:46:38,534 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:46:38,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:46:38,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:38,536 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:38,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:46:38,536 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:46:38,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:46:38,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:46:38,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:46:38,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:46:38,537 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 -> 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 [2025-01-09 12:46:38,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:46:38,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:46:38,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:46:38,795 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:46:38,796 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:46:38,797 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-79.i [2025-01-09 12:46:40,013 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c266ab970/223a1e205f7c4eb08d3962e2a0c69e68/FLAGf70407243 [2025-01-09 12:46:40,217 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:46:40,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2025-01-09 12:46:40,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c266ab970/223a1e205f7c4eb08d3962e2a0c69e68/FLAGf70407243 [2025-01-09 12:46:40,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c266ab970/223a1e205f7c4eb08d3962e2a0c69e68 [2025-01-09 12:46:40,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:46:40,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:46:40,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:40,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:46:40,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:46:40,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0615d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40, skipping insertion in model container [2025-01-09 12:46:40,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:46:40,368 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-79.i[916,929] [2025-01-09 12:46:40,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:40,421 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:46:40,430 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-79.i[916,929] [2025-01-09 12:46:40,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:46:40,463 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:46:40,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40 WrapperNode [2025-01-09 12:46:40,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:46:40,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:40,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:46:40,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:46:40,471 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:46:40" (1/1) ... [2025-01-09 12:46:40,479 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:46:40" (1/1) ... [2025-01-09 12:46:40,490 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2025-01-09 12:46:40,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:46:40,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:46:40,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:46:40,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:46:40,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,513 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:46:40,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:46:40,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:46:40,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:46:40,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:46:40,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (1/1) ... [2025-01-09 12:46:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:46:40,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:40,570 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:46:40,574 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:46:40,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:46:40,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:46:40,594 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:46:40,594 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:46:40,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:46:40,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:46:40,658 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:46:40,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:46:40,862 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 12:46:40,862 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:46:40,871 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:46:40,873 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:46:40,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:40 BoogieIcfgContainer [2025-01-09 12:46:40,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:46:40,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:46:40,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:46:40,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:46:40,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:46:40" (1/3) ... [2025-01-09 12:46:40,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2374c1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:40, skipping insertion in model container [2025-01-09 12:46:40,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:46:40" (2/3) ... [2025-01-09 12:46:40,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2374c1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:46:40, skipping insertion in model container [2025-01-09 12:46:40,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:46:40" (3/3) ... [2025-01-09 12:46:40,884 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2025-01-09 12:46:40,895 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:46:40,897 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-79.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:46:40,945 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:46:40,954 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;@310d0332, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:46:40,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:46:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 12:46:40,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:40,966 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:40,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:40,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1848124587, now seen corresponding path program 1 times [2025-01-09 12:46:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:40,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472979476] [2025-01-09 12:46:40,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:40,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:40,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:40,985 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:46:40,986 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:46:41,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 12:46:41,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 12:46:41,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:41,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:41,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:46:41,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-01-09 12:46:41,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:41,125 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:46:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472979476] [2025-01-09 12:46:41,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472979476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:41,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:41,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:46:41,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099514334] [2025-01-09 12:46:41,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:41,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:46:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:46:41,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:46:41,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:46:41,143 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:46:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:41,156 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2025-01-09 12:46:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:46:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2025-01-09 12:46:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:41,160 INFO L225 Difference]: With dead ends: 88 [2025-01-09 12:46:41,160 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 12:46:41,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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:46:41,165 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:41,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:46:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 12:46:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 12:46:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2025-01-09 12:46:41,188 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2025-01-09 12:46:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:41,188 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2025-01-09 12:46:41,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-01-09 12:46:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2025-01-09 12:46:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 12:46:41,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:41,191 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:41,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:46:41,392 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 [2025-01-09 12:46:41,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:41,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1853848427, now seen corresponding path program 1 times [2025-01-09 12:46:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383834411] [2025-01-09 12:46:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:41,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:41,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:41,396 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:46:41,398 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:46:41,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 12:46:41,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 12:46:41,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:41,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:41,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:46:41,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:46:41,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:46:41,571 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:46:41,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383834411] [2025-01-09 12:46:41,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383834411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:46:41,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:46:41,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 12:46:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450532905] [2025-01-09 12:46:41,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:46:41,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 12:46:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:46:41,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 12:46:41,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 12:46:41,573 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:46:41,759 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2025-01-09 12:46:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:46:41,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-01-09 12:46:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:46:41,762 INFO L225 Difference]: With dead ends: 93 [2025-01-09 12:46:41,762 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 12:46:41,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:46:41,763 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 67 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:46:41,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 96 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:46:41,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 12:46:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2025-01-09 12:46:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:46:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2025-01-09 12:46:41,770 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 91 [2025-01-09 12:46:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:46:41,771 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2025-01-09 12:46:41,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:46:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2025-01-09 12:46:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 12:46:41,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:46:41,773 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:41,786 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:46:41,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:41,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:46:41,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:46:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1870286693, now seen corresponding path program 1 times [2025-01-09 12:46:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:46:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287418092] [2025-01-09 12:46:41,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:46:41,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:46:41,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:46:41,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:46:41,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 12:46:42,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 12:46:42,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 12:46:42,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:46:42,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:46:42,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 12:46:42,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:46:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 49 proven. 84 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 12:46:48,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:47:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:47:05,686 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:47:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287418092] [2025-01-09 12:47:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287418092] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:05,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:47:05,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 26 [2025-01-09 12:47:05,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976905615] [2025-01-09 12:47:05,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:05,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 12:47:05,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:47:05,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 12:47:05,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2025-01-09 12:47:05,688 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:47:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:11,912 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2025-01-09 12:47:11,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 12:47:11,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2025-01-09 12:47:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:11,918 INFO L225 Difference]: With dead ends: 71 [2025-01-09 12:47:11,918 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 12:47:11,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2025-01-09 12:47:11,921 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 32 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:11,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 304 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 12:47:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 12:47:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2025-01-09 12:47:11,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:47:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2025-01-09 12:47:11,936 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 92 [2025-01-09 12:47:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:11,937 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2025-01-09 12:47:11,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:47:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2025-01-09 12:47:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 12:47:11,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:11,938 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:11,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:47:12,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:12,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:12,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:12,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1478541827, now seen corresponding path program 1 times [2025-01-09 12:47:12,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:47:12,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550608368] [2025-01-09 12:47:12,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:12,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:12,144 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:47:12,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 12:47:12,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 12:47:12,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 12:47:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:12,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 12:47:12,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:47:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 49 proven. 84 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-01-09 12:47:17,121 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:47:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 12:47:39,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:47:39,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550608368] [2025-01-09 12:47:39,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550608368] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 12:47:39,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:47:39,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 28 [2025-01-09 12:47:39,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113903965] [2025-01-09 12:47:39,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:47:39,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:47:39,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:47:39,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:47:39,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=628, Unknown=0, NotChecked=0, Total=756 [2025-01-09 12:47:39,341 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:47:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:47,928 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2025-01-09 12:47:47,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 12:47:47,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-01-09 12:47:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:47,933 INFO L225 Difference]: With dead ends: 78 [2025-01-09 12:47:47,933 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 12:47:47,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=197, Invalid=925, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 12:47:47,937 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 45 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:47,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 360 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 12:47:47,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 12:47:47,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 54. [2025-01-09 12:47:47,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 12:47:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 70 transitions. [2025-01-09 12:47:47,949 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 70 transitions. Word has length 93 [2025-01-09 12:47:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:47,950 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 70 transitions. [2025-01-09 12:47:47,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 12:47:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 70 transitions. [2025-01-09 12:47:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 12:47:47,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:47,951 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 12:47:48,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:48,152 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:48,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1655692428, now seen corresponding path program 1 times [2025-01-09 12:47:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:47:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604390254] [2025-01-09 12:47:48,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:48,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:48,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:48,155 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:47:48,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 12:47:48,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 12:47:48,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 12:47:48,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:48,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:48,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 12:47:48,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:47:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-01-09 12:47:48,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:47:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-01-09 12:47:48,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:47:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604390254] [2025-01-09 12:47:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604390254] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:47:48,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:47:48,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2025-01-09 12:47:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538322559] [2025-01-09 12:47:48,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:47:48,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:47:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:47:48,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:47:48,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:47:48,464 INFO L87 Difference]: Start difference. First operand 54 states and 70 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:47:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:47:48,892 INFO L93 Difference]: Finished difference Result 155 states and 194 transitions. [2025-01-09 12:47:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:47:48,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 93 [2025-01-09 12:47:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:47:48,894 INFO L225 Difference]: With dead ends: 155 [2025-01-09 12:47:48,894 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 12:47:48,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2025-01-09 12:47:48,895 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 92 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:47:48,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 231 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:47:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 12:47:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2025-01-09 12:47:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 63 states have internal predecessors, (69), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 12:47:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2025-01-09 12:47:48,903 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 93 [2025-01-09 12:47:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:47:48,903 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2025-01-09 12:47:48,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:47:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2025-01-09 12:47:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 12:47:48,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:47:48,904 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:48,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 12:47:49,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:49,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:47:49,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:47:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 846345802, now seen corresponding path program 1 times [2025-01-09 12:47:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:47:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2131583011] [2025-01-09 12:47:49,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:47:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:47:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:47:49,109 INFO L229 MonitoredProcess]: Starting monitored process 7 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:47:49,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 12:47:49,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 12:47:49,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 12:47:49,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:47:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:47:49,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 12:47:49,162 INFO L279 TraceCheckSpWp]: Computing forward predicates...