./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/linear_search.c --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/loops/linear_search.c -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 5daf86ff8189a9471a20a947a9c78ff63bc56ed2dde2c379166a5ef7ff47fae4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:52:56,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:52:56,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:52:56,310 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:52:56,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:52:56,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:52:56,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:52:56,340 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:52:56,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:52:56,341 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:52:56,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:52:56,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:52:56,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:52:56,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:52:56,341 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:52:56,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:52:56,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:52:56,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:52:56,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:52:56,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:52:56,343 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:52:56,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:52:56,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:52:56,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:52:56,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:52:56,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:52:56,344 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:52:56,344 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:52:56,344 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 -> 5daf86ff8189a9471a20a947a9c78ff63bc56ed2dde2c379166a5ef7ff47fae4 [2025-01-09 02:52:56,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:52:56,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:52:56,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:52:56,616 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:52:56,616 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:52:56,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/linear_search.c [2025-01-09 02:52:57,882 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cb4f439a/6c3df8495365402b8e2fdfbc762b89f1/FLAG240175c48 [2025-01-09 02:52:58,179 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:52:58,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/linear_search.c [2025-01-09 02:52:58,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cb4f439a/6c3df8495365402b8e2fdfbc762b89f1/FLAG240175c48 [2025-01-09 02:52:58,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1cb4f439a/6c3df8495365402b8e2fdfbc762b89f1 [2025-01-09 02:52:58,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:52:58,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:52:58,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:52:58,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:52:58,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:52:58,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577f00f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58, skipping insertion in model container [2025-01-09 02:52:58,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:52:58,630 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/loops/linear_search.c[383,396] [2025-01-09 02:52:58,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:52:58,661 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:52:58,671 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/loops/linear_search.c[383,396] [2025-01-09 02:52:58,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:52:58,691 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:52:58,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58 WrapperNode [2025-01-09 02:52:58,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:52:58,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:52:58,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:52:58,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:52:58,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,724 INFO L138 Inliner]: procedures = 17, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 57 [2025-01-09 02:52:58,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:52:58,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:52:58,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:52:58,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:52:58,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,753 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-09 02:52:58,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:52:58,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:52:58,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:52:58,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:52:58,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (1/1) ... [2025-01-09 02:52:58,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:52:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:52:58,804 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 02:52:58,810 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 02:52:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:52:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:52:58,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:52:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:52:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:52:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:52:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:52:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:52:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:52:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:52:58,904 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:52:58,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:52:59,044 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 02:52:59,044 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:52:59,052 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:52:59,052 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 02:52:59,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:59 BoogieIcfgContainer [2025-01-09 02:52:59,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:52:59,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:52:59,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:52:59,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:52:59,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:52:58" (1/3) ... [2025-01-09 02:52:59,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2454bae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:59, skipping insertion in model container [2025-01-09 02:52:59,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:52:58" (2/3) ... [2025-01-09 02:52:59,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2454bae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:52:59, skipping insertion in model container [2025-01-09 02:52:59,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:52:59" (3/3) ... [2025-01-09 02:52:59,061 INFO L128 eAbstractionObserver]: Analyzing ICFG linear_search.c [2025-01-09 02:52:59,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:52:59,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linear_search.c that has 1 procedures, 18 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 02:52:59,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:52:59,139 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;@5bc5b07a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:52:59,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:52:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:52:59,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 02:52:59,147 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:52:59,147 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:52:59,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:52:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:52:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash -632239999, now seen corresponding path program 1 times [2025-01-09 02:52:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:52:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100457706] [2025-01-09 02:52:59,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:52:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:52:59,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:52:59,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:52:59,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:52:59,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:52:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:52:59,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:52:59,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100457706] [2025-01-09 02:52:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100457706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:52:59,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:52:59,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:52:59,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810757844] [2025-01-09 02:52:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:52:59,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:52:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:52:59,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:52:59,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:52:59,398 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:52:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:52:59,411 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2025-01-09 02:52:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:52:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 02:52:59,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:52:59,421 INFO L225 Difference]: With dead ends: 27 [2025-01-09 02:52:59,422 INFO L226 Difference]: Without dead ends: 14 [2025-01-09 02:52:59,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 02:52:59,428 INFO L435 NwaCegarLoop]: 22 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, 22 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 02:52:59,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:52:59,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-09 02:52:59,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-09 02:52:59,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:52:59,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-01-09 02:52:59,459 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2025-01-09 02:52:59,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:52:59,460 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-01-09 02:52:59,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:52:59,460 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2025-01-09 02:52:59,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:52:59,461 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:52:59,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:52:59,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:52:59,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:52:59,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:52:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash 255590514, now seen corresponding path program 1 times [2025-01-09 02:52:59,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:52:59,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332042092] [2025-01-09 02:52:59,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:52:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:52:59,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:52:59,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:52:59,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:52:59,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:52:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:52:59,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:52:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332042092] [2025-01-09 02:52:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332042092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:52:59,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:52:59,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:52:59,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312272997] [2025-01-09 02:52:59,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:52:59,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:52:59,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:52:59,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:52:59,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:52:59,711 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:52:59,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:52:59,740 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2025-01-09 02:52:59,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:52:59,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 02:52:59,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:52:59,741 INFO L225 Difference]: With dead ends: 18 [2025-01-09 02:52:59,741 INFO L226 Difference]: Without dead ends: 14 [2025-01-09 02:52:59,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:52:59,742 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:52:59,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:52:59,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-09 02:52:59,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-09 02:52:59,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:52:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-01-09 02:52:59,745 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2025-01-09 02:52:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:52:59,745 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-01-09 02:52:59,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:52:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-01-09 02:52:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:52:59,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:52:59,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:52:59,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:52:59,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:52:59,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:52:59,746 INFO L85 PathProgramCache]: Analyzing trace with hash 255650096, now seen corresponding path program 1 times [2025-01-09 02:52:59,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:52:59,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875368890] [2025-01-09 02:52:59,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:52:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:52:59,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:52:59,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:52:59,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:52:59,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:52:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:52:59,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:52:59,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875368890] [2025-01-09 02:52:59,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875368890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:52:59,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:52:59,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:52:59,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932980671] [2025-01-09 02:52:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:52:59,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:52:59,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:52:59,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:52:59,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:52:59,969 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:00,012 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2025-01-09 02:53:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:53:00,013 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 02:53:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:00,013 INFO L225 Difference]: With dead ends: 23 [2025-01-09 02:53:00,013 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 02:53:00,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:00,014 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:00,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 16 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 02:53:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-01-09 02:53:00,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2025-01-09 02:53:00,018 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 11 [2025-01-09 02:53:00,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:00,018 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2025-01-09 02:53:00,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,018 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2025-01-09 02:53:00,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:53:00,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:00,019 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:00,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:53:00,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:00,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:00,020 INFO L85 PathProgramCache]: Analyzing trace with hash -375845432, now seen corresponding path program 1 times [2025-01-09 02:53:00,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:00,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970982401] [2025-01-09 02:53:00,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:00,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:00,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:53:00,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:53:00,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:00,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970982401] [2025-01-09 02:53:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970982401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:53:00,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:53:00,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:53:00,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647990006] [2025-01-09 02:53:00,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:53:00,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:53:00,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:00,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:53:00,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:53:00,096 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:00,113 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2025-01-09 02:53:00,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:53:00,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 02:53:00,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:00,114 INFO L225 Difference]: With dead ends: 29 [2025-01-09 02:53:00,114 INFO L226 Difference]: Without dead ends: 18 [2025-01-09 02:53:00,115 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 02:53:00,116 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:00,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:00,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-09 02:53:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-09 02:53:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-01-09 02:53:00,123 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2025-01-09 02:53:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:00,123 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-01-09 02:53:00,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-01-09 02:53:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:53:00,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:00,123 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:00,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:53:00,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:00,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1076910010, now seen corresponding path program 1 times [2025-01-09 02:53:00,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:00,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711316068] [2025-01-09 02:53:00,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:00,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:53:00,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:53:00,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:00,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:00,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:00,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711316068] [2025-01-09 02:53:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711316068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:53:00,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:53:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:53:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549903901] [2025-01-09 02:53:00,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:53:00,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:53:00,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:00,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:53:00,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:00,291 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:00,326 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2025-01-09 02:53:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:53:00,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 02:53:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:00,328 INFO L225 Difference]: With dead ends: 37 [2025-01-09 02:53:00,328 INFO L226 Difference]: Without dead ends: 26 [2025-01-09 02:53:00,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:53:00,329 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:00,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:53:00,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-09 02:53:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2025-01-09 02:53:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2025-01-09 02:53:00,335 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 16 [2025-01-09 02:53:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:00,335 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2025-01-09 02:53:00,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2025-01-09 02:53:00,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:53:00,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:00,337 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:00,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:53:00,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:00,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1886256636, now seen corresponding path program 1 times [2025-01-09 02:53:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:00,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096520878] [2025-01-09 02:53:00,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:00,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:00,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:53:00,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:53:00,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:00,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096520878] [2025-01-09 02:53:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096520878] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102797570] [2025-01-09 02:53:00,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:00,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:00,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:00,540 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 02:53:00,541 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 02:53:00,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:53:00,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:53:00,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:00,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:00,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 02:53:00,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:00,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:00,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:00,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:00,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102797570] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:00,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:00,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 9 [2025-01-09 02:53:00,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978033078] [2025-01-09 02:53:00,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:00,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:53:00,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:00,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:53:00,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:53:00,839 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:00,966 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-01-09 02:53:00,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:53:00,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 02:53:00,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:00,967 INFO L225 Difference]: With dead ends: 43 [2025-01-09 02:53:00,967 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 02:53:00,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 02:53:00,968 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:00,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:53:00,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 02:53:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2025-01-09 02:53:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-01-09 02:53:00,972 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 16 [2025-01-09 02:53:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:00,973 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-01-09 02:53:00,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-01-09 02:53:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:53:00,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:00,973 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:00,982 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 02:53:01,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:01,178 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:01,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:01,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1968376846, now seen corresponding path program 1 times [2025-01-09 02:53:01,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:01,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289180828] [2025-01-09 02:53:01,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:01,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:01,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 02:53:01,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:53:01,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:01,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:01,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289180828] [2025-01-09 02:53:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289180828] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596228976] [2025-01-09 02:53:01,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:53:01,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:01,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:01,311 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 02:53:01,312 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 02:53:01,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 02:53:01,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:53:01,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:53:01,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:01,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 02:53:01,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:01,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:01,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596228976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:01,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:01,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 02:53:01,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413403237] [2025-01-09 02:53:01,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:01,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 02:53:01,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:01,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 02:53:01,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:53:01,480 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:01,590 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2025-01-09 02:53:01,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 02:53:01,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 02:53:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:01,592 INFO L225 Difference]: With dead ends: 73 [2025-01-09 02:53:01,592 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 02:53:01,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-01-09 02:53:01,593 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:01,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 49 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:53:01,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 02:53:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2025-01-09 02:53:01,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:01,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-01-09 02:53:01,606 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 21 [2025-01-09 02:53:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:01,606 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-01-09 02:53:01,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-01-09 02:53:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:53:01,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:01,606 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:01,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:53:01,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:01,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:01,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1517243824, now seen corresponding path program 2 times [2025-01-09 02:53:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:01,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101795539] [2025-01-09 02:53:01,808 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:01,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-09 02:53:01,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:53:01,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:01,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:03,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:03,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101795539] [2025-01-09 02:53:03,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101795539] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:03,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202915701] [2025-01-09 02:53:03,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:53:03,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:03,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:03,600 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 02:53:03,602 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 02:53:03,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-09 02:53:03,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:53:03,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:53:03,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:03,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-01-09 02:53:03,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:03,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2025-01-09 02:53:03,799 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:53:03,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2025-01-09 02:53:04,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 02:53:04,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 29 [2025-01-09 02:53:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:04,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:53:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202915701] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:53:05,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:53:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 30 [2025-01-09 02:53:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055976543] [2025-01-09 02:53:05,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:53:05,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-09 02:53:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:53:05,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-09 02:53:05,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2025-01-09 02:53:05,477 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:53:07,068 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-01-09 02:53:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 02:53:07,068 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 02:53:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:53:07,069 INFO L225 Difference]: With dead ends: 66 [2025-01-09 02:53:07,069 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 02:53:07,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=625, Invalid=1925, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 02:53:07,070 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 174 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 02:53:07,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 56 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 02:53:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 02:53:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2025-01-09 02:53:07,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 51 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-01-09 02:53:07,077 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 21 [2025-01-09 02:53:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:53:07,078 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-01-09 02:53:07,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:53:07,078 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-01-09 02:53:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 02:53:07,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:53:07,079 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:53:07,087 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 02:53:07,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:07,283 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:53:07,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:53:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1756491216, now seen corresponding path program 3 times [2025-01-09 02:53:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:53:07,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305628407] [2025-01-09 02:53:07,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:53:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:53:07,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 5 equivalence classes. [2025-01-09 02:53:07,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 02:53:07,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 02:53:07,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:14,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:53:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305628407] [2025-01-09 02:53:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305628407] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:53:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635124681] [2025-01-09 02:53:14,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:53:14,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:53:14,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:53:14,330 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 02:53:14,331 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 02:53:14,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 5 equivalence classes. [2025-01-09 02:53:14,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 02:53:14,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 02:53:14,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:53:14,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-09 02:53:14,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:53:14,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 58 [2025-01-09 02:53:14,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2025-01-09 02:53:14,510 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 02:53:15,321 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2025-01-09 02:53:15,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 53 [2025-01-09 02:53:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:53:15,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:54:00,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2025-01-09 02:54:00,534 INFO L349 Elim1Store]: treesize reduction 33, result has 2.9 percent of original size [2025-01-09 02:54:00,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 1 [2025-01-09 02:54:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:54:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635124681] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:54:00,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:54:00,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 19] total 51 [2025-01-09 02:54:00,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227115428] [2025-01-09 02:54:00,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:54:00,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 02:54:00,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:54:00,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 02:54:00,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2202, Unknown=1, NotChecked=0, Total=2550 [2025-01-09 02:54:00,538 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 51 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 51 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:19,650 WARN L286 SmtUtils]: Spent 13.31s on a formula simplification. DAG size of input: 130 DAG size of output: 89 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)