./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.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/bitvector/s3_srvr_2a_alt.BV.c.cil.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 ffdd9c6c8ed32275119d4b9d2dc66b9f80986fea1a039186a702d6c803e62485 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:48:26,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:48:26,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:48:26,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:48:26,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:48:26,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:48:26,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:48:26,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:48:26,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:48:26,808 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:48:26,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:48:26,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:48:26,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:48:26,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:48:26,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:48:26,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:26,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:26,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:48:26,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:48:26,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:48:26,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:48:26,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:48:26,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:48:26,812 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 -> ffdd9c6c8ed32275119d4b9d2dc66b9f80986fea1a039186a702d6c803e62485 [2025-01-08 22:48:27,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:48:27,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:48:27,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:48:27,051 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:48:27,052 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:48:27,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2025-01-08 22:48:28,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce6bbe458/35cecb7ad7a34ee3bf43f99cf0865bb0/FLAG9216f0a27 [2025-01-08 22:48:28,501 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:48:28,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_srvr_2a_alt.BV.c.cil.c [2025-01-08 22:48:28,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce6bbe458/35cecb7ad7a34ee3bf43f99cf0865bb0/FLAG9216f0a27 [2025-01-08 22:48:28,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce6bbe458/35cecb7ad7a34ee3bf43f99cf0865bb0 [2025-01-08 22:48:28,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:48:28,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:48:28,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:28,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:48:28,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:48:28,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572e1060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28, skipping insertion in model container [2025-01-08 22:48:28,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:48:28,720 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/bitvector/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2025-01-08 22:48:28,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:28,738 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:48:28,778 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/bitvector/s3_srvr_2a_alt.BV.c.cil.c[44811,44824] [2025-01-08 22:48:28,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:48:28,797 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:48:28,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28 WrapperNode [2025-01-08 22:48:28,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:48:28,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:28,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:48:28,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:48:28,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,842 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 566 [2025-01-08 22:48:28,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:48:28,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:48:28,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:48:28,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:48:28,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,872 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:48:28,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,880 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:48:28,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:48:28,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:48:28,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:48:28,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (1/1) ... [2025-01-08 22:48:28,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:48:28,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:28,932 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-08 22:48:28,937 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-08 22:48:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:48:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:48:28,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:48:28,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:48:29,025 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:48:29,027 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:48:29,038 WARN L773 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2025-01-08 22:48:29,369 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##89: assume !false; [2025-01-08 22:48:29,369 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume false; [2025-01-08 22:48:29,399 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-01-08 22:48:29,399 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:48:29,409 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:48:29,410 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:48:29,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:29 BoogieIcfgContainer [2025-01-08 22:48:29,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:48:29,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:48:29,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:48:29,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:48:29,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:48:28" (1/3) ... [2025-01-08 22:48:29,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d093625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:29, skipping insertion in model container [2025-01-08 22:48:29,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:48:28" (2/3) ... [2025-01-08 22:48:29,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d093625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:48:29, skipping insertion in model container [2025-01-08 22:48:29,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:29" (3/3) ... [2025-01-08 22:48:29,418 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_srvr_2a_alt.BV.c.cil.c [2025-01-08 22:48:29,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:48:29,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_srvr_2a_alt.BV.c.cil.c that has 1 procedures, 137 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:48:29,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:48:29,467 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;@19c06051, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:48:29,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:48:29,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 136 states have internal predecessors, (235), 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-08 22:48:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:48:29,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:29,475 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:29,475 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:29,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1563037092, now seen corresponding path program 1 times [2025-01-08 22:48:29,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:29,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856028347] [2025-01-08 22:48:29,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:29,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:29,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:48:29,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:48:29,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:29,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:29,827 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-08 22:48:29,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:29,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856028347] [2025-01-08 22:48:29,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856028347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:29,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:29,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:29,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116139712] [2025-01-08 22:48:29,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:29,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:29,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:29,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:29,847 INFO L87 Difference]: Start difference. First operand has 137 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 136 states have internal predecessors, (235), 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 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 22:48:30,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:30,003 INFO L93 Difference]: Finished difference Result 306 states and 532 transitions. [2025-01-08 22:48:30,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:30,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 43 [2025-01-08 22:48:30,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:30,010 INFO L225 Difference]: With dead ends: 306 [2025-01-08 22:48:30,010 INFO L226 Difference]: Without dead ends: 154 [2025-01-08 22:48:30,012 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-08 22:48:30,014 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 41 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:30,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 255 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:30,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-08 22:48:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-08 22:48:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.607843137254902) internal successors, (246), 153 states have internal predecessors, (246), 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-08 22:48:30,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 246 transitions. [2025-01-08 22:48:30,040 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 246 transitions. Word has length 43 [2025-01-08 22:48:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:30,040 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 246 transitions. [2025-01-08 22:48:30,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-08 22:48:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 246 transitions. [2025-01-08 22:48:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 22:48:30,042 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:30,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:30,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:48:30,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:30,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1202474052, now seen corresponding path program 1 times [2025-01-08 22:48:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:30,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042491295] [2025-01-08 22:48:30,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:30,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:30,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 22:48:30,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 22:48:30,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:30,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:30,180 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-08 22:48:30,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:30,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042491295] [2025-01-08 22:48:30,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042491295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:30,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:30,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:30,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781478856] [2025-01-08 22:48:30,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:30,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:30,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:30,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:30,183 INFO L87 Difference]: Start difference. First operand 154 states and 246 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-08 22:48:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:30,343 INFO L93 Difference]: Finished difference Result 342 states and 555 transitions. [2025-01-08 22:48:30,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:30,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2025-01-08 22:48:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:30,344 INFO L225 Difference]: With dead ends: 342 [2025-01-08 22:48:30,344 INFO L226 Difference]: Without dead ends: 194 [2025-01-08 22:48:30,345 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-08 22:48:30,345 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:30,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 179 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-08 22:48:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-01-08 22:48:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.6424870466321244) internal successors, (317), 193 states have internal predecessors, (317), 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-08 22:48:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 317 transitions. [2025-01-08 22:48:30,356 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 317 transitions. Word has length 44 [2025-01-08 22:48:30,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:30,356 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 317 transitions. [2025-01-08 22:48:30,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-08 22:48:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 317 transitions. [2025-01-08 22:48:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-08 22:48:30,357 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:30,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:30,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:48:30,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:30,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1491471367, now seen corresponding path program 1 times [2025-01-08 22:48:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:30,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630416585] [2025-01-08 22:48:30,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:30,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:30,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-08 22:48:30,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-08 22:48:30,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:30,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630416585] [2025-01-08 22:48:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630416585] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715543077] [2025-01-08 22:48:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:30,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:30,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:30,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:30,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:30,437 INFO L87 Difference]: Start difference. First operand 194 states and 317 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 22:48:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:30,476 INFO L93 Difference]: Finished difference Result 560 states and 920 transitions. [2025-01-08 22:48:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:30,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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) Word has length 58 [2025-01-08 22:48:30,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:30,482 INFO L225 Difference]: With dead ends: 560 [2025-01-08 22:48:30,482 INFO L226 Difference]: Without dead ends: 374 [2025-01-08 22:48:30,483 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-08 22:48:30,483 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 111 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:30,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 472 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-01-08 22:48:30,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2025-01-08 22:48:30,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 1.6380697050938338) internal successors, (611), 373 states have internal predecessors, (611), 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-08 22:48:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 611 transitions. [2025-01-08 22:48:30,510 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 611 transitions. Word has length 58 [2025-01-08 22:48:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:30,510 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 611 transitions. [2025-01-08 22:48:30,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 22:48:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 611 transitions. [2025-01-08 22:48:30,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-08 22:48:30,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:30,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:30,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:48:30,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:30,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:30,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1915118089, now seen corresponding path program 1 times [2025-01-08 22:48:30,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:30,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796753264] [2025-01-08 22:48:30,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:30,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:30,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-08 22:48:30,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-08 22:48:30,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:30,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:30,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:48:30,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:30,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796753264] [2025-01-08 22:48:30,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796753264] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881572134] [2025-01-08 22:48:30,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:30,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:30,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:30,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:30,567 INFO L87 Difference]: Start difference. First operand 374 states and 611 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 22:48:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:30,608 INFO L93 Difference]: Finished difference Result 923 states and 1513 transitions. [2025-01-08 22:48:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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) Word has length 58 [2025-01-08 22:48:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:30,610 INFO L225 Difference]: With dead ends: 923 [2025-01-08 22:48:30,611 INFO L226 Difference]: Without dead ends: 557 [2025-01-08 22:48:30,612 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-08 22:48:30,613 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 148 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:30,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 328 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-08 22:48:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-01-08 22:48:30,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 1.6348920863309353) internal successors, (909), 556 states have internal predecessors, (909), 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-08 22:48:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 909 transitions. [2025-01-08 22:48:30,626 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 909 transitions. Word has length 58 [2025-01-08 22:48:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:30,626 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 909 transitions. [2025-01-08 22:48:30,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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-08 22:48:30,626 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 909 transitions. [2025-01-08 22:48:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-08 22:48:30,627 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:30,627 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:48:30,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1371843566, now seen corresponding path program 1 times [2025-01-08 22:48:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493542646] [2025-01-08 22:48:30,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:30,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-08 22:48:30,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-08 22:48:30,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:30,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:30,703 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:48:30,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:30,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493542646] [2025-01-08 22:48:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493542646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:30,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:30,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3023256] [2025-01-08 22:48:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:30,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:30,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:30,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:30,706 INFO L87 Difference]: Start difference. First operand 557 states and 909 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-08 22:48:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:30,845 INFO L93 Difference]: Finished difference Result 1311 states and 2168 transitions. [2025-01-08 22:48:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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) Word has length 93 [2025-01-08 22:48:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:30,848 INFO L225 Difference]: With dead ends: 1311 [2025-01-08 22:48:30,848 INFO L226 Difference]: Without dead ends: 762 [2025-01-08 22:48:30,849 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-08 22:48:30,849 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 35 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:30,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 268 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-01-08 22:48:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 710. [2025-01-08 22:48:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.5768688293370945) internal successors, (1118), 709 states have internal predecessors, (1118), 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-08 22:48:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1118 transitions. [2025-01-08 22:48:30,862 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1118 transitions. Word has length 93 [2025-01-08 22:48:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:30,862 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1118 transitions. [2025-01-08 22:48:30,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-08 22:48:30,862 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1118 transitions. [2025-01-08 22:48:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-08 22:48:30,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:30,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:30,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:48:30,864 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:30,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:30,864 INFO L85 PathProgramCache]: Analyzing trace with hash 693323030, now seen corresponding path program 1 times [2025-01-08 22:48:30,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:30,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746339407] [2025-01-08 22:48:30,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:30,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:30,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-08 22:48:30,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-08 22:48:30,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:30,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-08 22:48:30,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:30,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746339407] [2025-01-08 22:48:30,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746339407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:30,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:30,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:30,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674065521] [2025-01-08 22:48:30,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:30,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:30,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:30,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:30,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:30,927 INFO L87 Difference]: Start difference. First operand 710 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-08 22:48:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:31,009 INFO L93 Difference]: Finished difference Result 1458 states and 2282 transitions. [2025-01-08 22:48:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:31,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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 117 [2025-01-08 22:48:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:31,012 INFO L225 Difference]: With dead ends: 1458 [2025-01-08 22:48:31,012 INFO L226 Difference]: Without dead ends: 756 [2025-01-08 22:48:31,013 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-08 22:48:31,013 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:31,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 269 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-01-08 22:48:31,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2025-01-08 22:48:31,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5549668874172184) internal successors, (1174), 755 states have internal predecessors, (1174), 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-08 22:48:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1174 transitions. [2025-01-08 22:48:31,025 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1174 transitions. Word has length 117 [2025-01-08 22:48:31,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:31,025 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1174 transitions. [2025-01-08 22:48:31,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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-08 22:48:31,025 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1174 transitions. [2025-01-08 22:48:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-08 22:48:31,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:31,027 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:31,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:48:31,027 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:31,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:31,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1835825496, now seen corresponding path program 1 times [2025-01-08 22:48:31,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:31,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866770380] [2025-01-08 22:48:31,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:31,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-08 22:48:31,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-08 22:48:31,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:31,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:31,078 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-08 22:48:31,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:31,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866770380] [2025-01-08 22:48:31,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866770380] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:31,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:31,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:31,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8638867] [2025-01-08 22:48:31,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:31,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:31,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:31,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:31,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:31,080 INFO L87 Difference]: Start difference. First operand 756 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-08 22:48:31,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:31,105 INFO L93 Difference]: Finished difference Result 1509 states and 2362 transitions. [2025-01-08 22:48:31,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:31,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 117 [2025-01-08 22:48:31,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:31,109 INFO L225 Difference]: With dead ends: 1509 [2025-01-08 22:48:31,109 INFO L226 Difference]: Without dead ends: 998 [2025-01-08 22:48:31,109 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-08 22:48:31,110 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 111 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:31,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 481 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-01-08 22:48:31,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2025-01-08 22:48:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 997 states have (on average 1.5606820461384152) internal successors, (1556), 997 states have internal predecessors, (1556), 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-08 22:48:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1556 transitions. [2025-01-08 22:48:31,125 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1556 transitions. Word has length 117 [2025-01-08 22:48:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:31,125 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1556 transitions. [2025-01-08 22:48:31,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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-08 22:48:31,125 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1556 transitions. [2025-01-08 22:48:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-08 22:48:31,127 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:31,127 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:31,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:48:31,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:31,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:31,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2083971990, now seen corresponding path program 1 times [2025-01-08 22:48:31,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:31,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118191166] [2025-01-08 22:48:31,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:31,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:31,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-08 22:48:31,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-08 22:48:31,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:31,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:48:31,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:31,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118191166] [2025-01-08 22:48:31,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118191166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:31,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:31,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:31,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108035525] [2025-01-08 22:48:31,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:31,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:31,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:31,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:31,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:31,179 INFO L87 Difference]: Start difference. First operand 998 states and 1556 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-08 22:48:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:31,213 INFO L93 Difference]: Finished difference Result 1987 states and 3113 transitions. [2025-01-08 22:48:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:31,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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 117 [2025-01-08 22:48:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:31,217 INFO L225 Difference]: With dead ends: 1987 [2025-01-08 22:48:31,217 INFO L226 Difference]: Without dead ends: 1234 [2025-01-08 22:48:31,217 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-08 22:48:31,218 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 113 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:31,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 482 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:31,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2025-01-08 22:48:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2025-01-08 22:48:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1233 states have (on average 1.5612327656123277) internal successors, (1925), 1233 states have internal predecessors, (1925), 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-08 22:48:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1925 transitions. [2025-01-08 22:48:31,238 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1925 transitions. Word has length 117 [2025-01-08 22:48:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:31,238 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1925 transitions. [2025-01-08 22:48:31,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 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-08 22:48:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1925 transitions. [2025-01-08 22:48:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-08 22:48:31,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:31,241 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:31,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:48:31,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:31,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash 356674639, now seen corresponding path program 1 times [2025-01-08 22:48:31,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:31,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639785506] [2025-01-08 22:48:31,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:31,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:31,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-08 22:48:31,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-08 22:48:31,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:31,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-01-08 22:48:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639785506] [2025-01-08 22:48:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639785506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:31,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111628543] [2025-01-08 22:48:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:31,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:31,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:31,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:31,318 INFO L87 Difference]: Start difference. First operand 1234 states and 1925 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-08 22:48:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:31,449 INFO L93 Difference]: Finished difference Result 2493 states and 3901 transitions. [2025-01-08 22:48:31,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:31,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 202 [2025-01-08 22:48:31,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:31,453 INFO L225 Difference]: With dead ends: 2493 [2025-01-08 22:48:31,454 INFO L226 Difference]: Without dead ends: 1267 [2025-01-08 22:48:31,454 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-08 22:48:31,456 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 22 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:31,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 268 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:31,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-01-08 22:48:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1264. [2025-01-08 22:48:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.5146476642913698) internal successors, (1913), 1263 states have internal predecessors, (1913), 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-08 22:48:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1913 transitions. [2025-01-08 22:48:31,505 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1913 transitions. Word has length 202 [2025-01-08 22:48:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:31,505 INFO L471 AbstractCegarLoop]: Abstraction has 1264 states and 1913 transitions. [2025-01-08 22:48:31,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-08 22:48:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1913 transitions. [2025-01-08 22:48:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-08 22:48:31,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:31,508 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:31,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:48:31,508 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:31,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 352785180, now seen corresponding path program 1 times [2025-01-08 22:48:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807904077] [2025-01-08 22:48:31,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:31,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:31,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-08 22:48:31,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-08 22:48:31,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:31,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-08 22:48:31,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807904077] [2025-01-08 22:48:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807904077] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:31,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531101534] [2025-01-08 22:48:31,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:31,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:31,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:31,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:31,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:31,575 INFO L87 Difference]: Start difference. First operand 1264 states and 1913 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-08 22:48:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:31,698 INFO L93 Difference]: Finished difference Result 2720 states and 4169 transitions. [2025-01-08 22:48:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:31,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 218 [2025-01-08 22:48:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:31,702 INFO L225 Difference]: With dead ends: 2720 [2025-01-08 22:48:31,702 INFO L226 Difference]: Without dead ends: 1414 [2025-01-08 22:48:31,703 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-08 22:48:31,703 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:31,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 254 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2025-01-08 22:48:31,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2025-01-08 22:48:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.4777070063694266) internal successors, (2088), 1413 states have internal predecessors, (2088), 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-08 22:48:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2088 transitions. [2025-01-08 22:48:31,726 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2088 transitions. Word has length 218 [2025-01-08 22:48:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:31,727 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2088 transitions. [2025-01-08 22:48:31,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-08 22:48:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2088 transitions. [2025-01-08 22:48:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-01-08 22:48:31,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:31,730 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:31,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:48:31,730 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:31,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -136724129, now seen corresponding path program 1 times [2025-01-08 22:48:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:31,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658987322] [2025-01-08 22:48:31,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:31,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-08 22:48:31,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-08 22:48:31,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:31,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 410 proven. 15 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-08 22:48:31,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:31,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658987322] [2025-01-08 22:48:31,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658987322] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:31,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433476112] [2025-01-08 22:48:31,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:31,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:31,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:31,834 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-08 22:48:31,835 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-08 22:48:31,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-08 22:48:31,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-08 22:48:31,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:31,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:31,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:31,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 410 proven. 15 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-08 22:48:32,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 410 proven. 15 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-08 22:48:32,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433476112] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:32,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:32,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 22:48:32,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270750392] [2025-01-08 22:48:32,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:32,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:32,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:32,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:32,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:32,093 INFO L87 Difference]: Start difference. First operand 1414 states and 2088 transitions. Second operand has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 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-08 22:48:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:32,648 INFO L93 Difference]: Finished difference Result 5541 states and 8201 transitions. [2025-01-08 22:48:32,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-08 22:48:32,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 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 245 [2025-01-08 22:48:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:32,660 INFO L225 Difference]: With dead ends: 5541 [2025-01-08 22:48:32,660 INFO L226 Difference]: Without dead ends: 4135 [2025-01-08 22:48:32,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:48:32,663 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 276 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:32,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1133 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:48:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4135 states. [2025-01-08 22:48:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4135 to 3472. [2025-01-08 22:48:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3472 states, 3471 states have (on average 1.4050705848458658) internal successors, (4877), 3471 states have internal predecessors, (4877), 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-08 22:48:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3472 states to 3472 states and 4877 transitions. [2025-01-08 22:48:32,745 INFO L78 Accepts]: Start accepts. Automaton has 3472 states and 4877 transitions. Word has length 245 [2025-01-08 22:48:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:32,746 INFO L471 AbstractCegarLoop]: Abstraction has 3472 states and 4877 transitions. [2025-01-08 22:48:32,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.333333333333336) internal successors, (200), 6 states have internal predecessors, (200), 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-08 22:48:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3472 states and 4877 transitions. [2025-01-08 22:48:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-01-08 22:48:32,752 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:32,752 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:32,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:48:32,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 22:48:32,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:32,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash -721495779, now seen corresponding path program 1 times [2025-01-08 22:48:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193535121] [2025-01-08 22:48:32,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:32,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-08 22:48:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-08 22:48:32,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2025-01-08 22:48:33,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:33,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193535121] [2025-01-08 22:48:33,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193535121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:33,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:33,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:33,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429483413] [2025-01-08 22:48:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:33,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:33,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:33,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:33,042 INFO L87 Difference]: Start difference. First operand 3472 states and 4877 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-08 22:48:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:33,100 INFO L93 Difference]: Finished difference Result 9461 states and 13498 transitions. [2025-01-08 22:48:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:33,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 245 [2025-01-08 22:48:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:33,111 INFO L225 Difference]: With dead ends: 9461 [2025-01-08 22:48:33,111 INFO L226 Difference]: Without dead ends: 4043 [2025-01-08 22:48:33,116 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-08 22:48:33,117 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 109 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:33,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 489 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4043 states. [2025-01-08 22:48:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4043 to 3752. [2025-01-08 22:48:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3752 states, 3751 states have (on average 1.4422820581178353) internal successors, (5410), 3751 states have internal predecessors, (5410), 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-08 22:48:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 5410 transitions. [2025-01-08 22:48:33,185 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 5410 transitions. Word has length 245 [2025-01-08 22:48:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:33,185 INFO L471 AbstractCegarLoop]: Abstraction has 3752 states and 5410 transitions. [2025-01-08 22:48:33,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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-08 22:48:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 5410 transitions. [2025-01-08 22:48:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2025-01-08 22:48:33,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:33,189 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:33,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:48:33,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:33,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:33,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1570365461, now seen corresponding path program 1 times [2025-01-08 22:48:33,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:33,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625718743] [2025-01-08 22:48:33,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:33,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:33,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes. [2025-01-08 22:48:33,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements. [2025-01-08 22:48:33,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:33,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 346 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-01-08 22:48:33,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:33,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625718743] [2025-01-08 22:48:33,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625718743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:33,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:33,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:33,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201230789] [2025-01-08 22:48:33,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:33,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:33,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:33,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:33,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:33,245 INFO L87 Difference]: Start difference. First operand 3752 states and 5410 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-08 22:48:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:33,363 INFO L93 Difference]: Finished difference Result 7832 states and 11256 transitions. [2025-01-08 22:48:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:33,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 264 [2025-01-08 22:48:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:33,374 INFO L225 Difference]: With dead ends: 7832 [2025-01-08 22:48:33,375 INFO L226 Difference]: Without dead ends: 4088 [2025-01-08 22:48:33,379 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-08 22:48:33,379 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:33,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 269 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2025-01-08 22:48:33,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4088. [2025-01-08 22:48:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4088 states, 4087 states have (on average 1.4230486909713727) internal successors, (5816), 4087 states have internal predecessors, (5816), 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-08 22:48:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4088 states to 4088 states and 5816 transitions. [2025-01-08 22:48:33,473 INFO L78 Accepts]: Start accepts. Automaton has 4088 states and 5816 transitions. Word has length 264 [2025-01-08 22:48:33,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:33,473 INFO L471 AbstractCegarLoop]: Abstraction has 4088 states and 5816 transitions. [2025-01-08 22:48:33,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-08 22:48:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4088 states and 5816 transitions. [2025-01-08 22:48:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-01-08 22:48:33,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:33,479 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:33,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:48:33,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:33,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash 365697345, now seen corresponding path program 1 times [2025-01-08 22:48:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:33,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665754587] [2025-01-08 22:48:33,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:33,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-01-08 22:48:33,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-01-08 22:48:33,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:33,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 830 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-01-08 22:48:33,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:33,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665754587] [2025-01-08 22:48:33,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665754587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:33,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:33,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696740128] [2025-01-08 22:48:33,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:33,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:33,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:33,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:33,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:33,540 INFO L87 Difference]: Start difference. First operand 4088 states and 5816 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-08 22:48:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:33,666 INFO L93 Difference]: Finished difference Result 8532 states and 12124 transitions. [2025-01-08 22:48:33,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:33,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 289 [2025-01-08 22:48:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:33,678 INFO L225 Difference]: With dead ends: 8532 [2025-01-08 22:48:33,678 INFO L226 Difference]: Without dead ends: 4452 [2025-01-08 22:48:33,683 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-08 22:48:33,683 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:33,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 269 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:33,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2025-01-08 22:48:33,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 4452. [2025-01-08 22:48:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 4451 states have (on average 1.4041788362165806) internal successors, (6250), 4451 states have internal predecessors, (6250), 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-08 22:48:33,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 6250 transitions. [2025-01-08 22:48:33,760 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 6250 transitions. Word has length 289 [2025-01-08 22:48:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:33,760 INFO L471 AbstractCegarLoop]: Abstraction has 4452 states and 6250 transitions. [2025-01-08 22:48:33,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-08 22:48:33,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 6250 transitions. [2025-01-08 22:48:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-08 22:48:33,765 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:33,766 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:33,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:48:33,766 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:33,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:33,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1675973102, now seen corresponding path program 1 times [2025-01-08 22:48:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:33,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789703513] [2025-01-08 22:48:33,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:33,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-08 22:48:33,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-08 22:48:33,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:33,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1011 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-01-08 22:48:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:33,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789703513] [2025-01-08 22:48:33,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789703513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:33,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:33,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:33,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236856103] [2025-01-08 22:48:33,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:33,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:33,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:33,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:33,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:33,837 INFO L87 Difference]: Start difference. First operand 4452 states and 6250 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-08 22:48:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:33,968 INFO L93 Difference]: Finished difference Result 9288 states and 13048 transitions. [2025-01-08 22:48:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:33,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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 311 [2025-01-08 22:48:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:33,979 INFO L225 Difference]: With dead ends: 9288 [2025-01-08 22:48:33,979 INFO L226 Difference]: Without dead ends: 4844 [2025-01-08 22:48:33,984 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-08 22:48:33,985 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:33,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 269 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4844 states. [2025-01-08 22:48:34,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4844 to 4077. [2025-01-08 22:48:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4077 states, 4076 states have (on average 1.405053974484789) internal successors, (5727), 4076 states have internal predecessors, (5727), 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-08 22:48:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4077 states to 4077 states and 5727 transitions. [2025-01-08 22:48:34,066 INFO L78 Accepts]: Start accepts. Automaton has 4077 states and 5727 transitions. Word has length 311 [2025-01-08 22:48:34,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:34,066 INFO L471 AbstractCegarLoop]: Abstraction has 4077 states and 5727 transitions. [2025-01-08 22:48:34,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-08 22:48:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4077 states and 5727 transitions. [2025-01-08 22:48:34,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2025-01-08 22:48:34,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:34,080 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 22:48:34,080 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:34,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1034824257, now seen corresponding path program 1 times [2025-01-08 22:48:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984349911] [2025-01-08 22:48:34,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:34,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes. [2025-01-08 22:48:34,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements. [2025-01-08 22:48:34,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 651 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-01-08 22:48:34,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:34,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984349911] [2025-01-08 22:48:34,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984349911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:34,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:34,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:34,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784357764] [2025-01-08 22:48:34,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:34,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:34,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:34,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:34,214 INFO L87 Difference]: Start difference. First operand 4077 states and 5727 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-08 22:48:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:34,283 INFO L93 Difference]: Finished difference Result 12201 states and 17136 transitions. [2025-01-08 22:48:34,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:34,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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 342 [2025-01-08 22:48:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:34,297 INFO L225 Difference]: With dead ends: 12201 [2025-01-08 22:48:34,297 INFO L226 Difference]: Without dead ends: 8132 [2025-01-08 22:48:34,303 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-08 22:48:34,303 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 125 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:34,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 483 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8132 states. [2025-01-08 22:48:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8132 to 7996. [2025-01-08 22:48:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7996 states, 7995 states have (on average 1.4067542213883677) internal successors, (11247), 7995 states have internal predecessors, (11247), 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-08 22:48:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7996 states to 7996 states and 11247 transitions. [2025-01-08 22:48:34,464 INFO L78 Accepts]: Start accepts. Automaton has 7996 states and 11247 transitions. Word has length 342 [2025-01-08 22:48:34,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:34,465 INFO L471 AbstractCegarLoop]: Abstraction has 7996 states and 11247 transitions. [2025-01-08 22:48:34,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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-08 22:48:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 7996 states and 11247 transitions. [2025-01-08 22:48:34,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2025-01-08 22:48:34,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:34,474 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:34,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:48:34,474 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:34,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1138680506, now seen corresponding path program 1 times [2025-01-08 22:48:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61222883] [2025-01-08 22:48:34,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:34,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-08 22:48:34,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-08 22:48:34,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 826 proven. 25 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2025-01-08 22:48:34,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:34,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61222883] [2025-01-08 22:48:34,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61222883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:34,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900269299] [2025-01-08 22:48:34,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:34,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:34,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:34,578 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-08 22:48:34,579 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-08 22:48:34,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes. [2025-01-08 22:48:34,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements. [2025-01-08 22:48:34,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:34,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:34,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:34,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 591 trivial. 0 not checked. [2025-01-08 22:48:34,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:48:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900269299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:48:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:48:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343303327] [2025-01-08 22:48:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:34,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:34,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:34,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:34,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:34,980 INFO L87 Difference]: Start difference. First operand 7996 states and 11247 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-08 22:48:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:35,049 INFO L93 Difference]: Finished difference Result 10120 states and 14228 transitions. [2025-01-08 22:48:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:35,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 343 [2025-01-08 22:48:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:35,063 INFO L225 Difference]: With dead ends: 10120 [2025-01-08 22:48:35,063 INFO L226 Difference]: Without dead ends: 7966 [2025-01-08 22:48:35,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:48:35,068 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 83 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:35,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 477 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:48:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7966 states. [2025-01-08 22:48:35,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7966 to 5612. [2025-01-08 22:48:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5612 states, 5611 states have (on average 1.4197112814115131) internal successors, (7966), 5611 states have internal predecessors, (7966), 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-08 22:48:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5612 states to 5612 states and 7966 transitions. [2025-01-08 22:48:35,203 INFO L78 Accepts]: Start accepts. Automaton has 5612 states and 7966 transitions. Word has length 343 [2025-01-08 22:48:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:35,204 INFO L471 AbstractCegarLoop]: Abstraction has 5612 states and 7966 transitions. [2025-01-08 22:48:35,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-08 22:48:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 5612 states and 7966 transitions. [2025-01-08 22:48:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2025-01-08 22:48:35,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:35,212 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:35,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:48:35,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 22:48:35,412 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:35,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:35,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1624254488, now seen corresponding path program 1 times [2025-01-08 22:48:35,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:35,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624158072] [2025-01-08 22:48:35,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:35,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-08 22:48:35,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-08 22:48:35,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:35,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 1185 proven. 25 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-01-08 22:48:35,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624158072] [2025-01-08 22:48:35,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624158072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:35,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143499960] [2025-01-08 22:48:35,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:35,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:35,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:35,528 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-08 22:48:35,530 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-08 22:48:35,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 402 statements into 1 equivalence classes. [2025-01-08 22:48:35,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 402 of 402 statements. [2025-01-08 22:48:35,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:35,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:35,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:35,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 1185 proven. 25 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-01-08 22:48:35,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1899 backedges. 1185 proven. 25 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2025-01-08 22:48:35,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143499960] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:35,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:35,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 22:48:35,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899919315] [2025-01-08 22:48:35,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:35,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 22:48:35,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:35,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 22:48:35,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:48:35,858 INFO L87 Difference]: Start difference. First operand 5612 states and 7966 transitions. Second operand has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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-08 22:48:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:36,299 INFO L93 Difference]: Finished difference Result 13051 states and 18394 transitions. [2025-01-08 22:48:36,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:48:36,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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 402 [2025-01-08 22:48:36,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:36,309 INFO L225 Difference]: With dead ends: 13051 [2025-01-08 22:48:36,309 INFO L226 Difference]: Without dead ends: 7145 [2025-01-08 22:48:36,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:36,316 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 209 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:36,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 717 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:48:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7145 states. [2025-01-08 22:48:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7145 to 5885. [2025-01-08 22:48:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5885 states, 5884 states have (on average 1.3788239292997961) internal successors, (8113), 5884 states have internal predecessors, (8113), 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-08 22:48:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5885 states to 5885 states and 8113 transitions. [2025-01-08 22:48:36,411 INFO L78 Accepts]: Start accepts. Automaton has 5885 states and 8113 transitions. Word has length 402 [2025-01-08 22:48:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:36,411 INFO L471 AbstractCegarLoop]: Abstraction has 5885 states and 8113 transitions. [2025-01-08 22:48:36,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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-08 22:48:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5885 states and 8113 transitions. [2025-01-08 22:48:36,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-08 22:48:36,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:36,421 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:36,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:48:36,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:36,625 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:36,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1237746962, now seen corresponding path program 1 times [2025-01-08 22:48:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570470006] [2025-01-08 22:48:36,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:36,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-08 22:48:36,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-08 22:48:36,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:36,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2967 backedges. 1576 proven. 0 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2025-01-08 22:48:36,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:36,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570470006] [2025-01-08 22:48:36,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570470006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:36,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:36,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:36,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852526408] [2025-01-08 22:48:36,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:36,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:36,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:36,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:36,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:36,893 INFO L87 Difference]: Start difference. First operand 5885 states and 8113 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-08 22:48:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:37,018 INFO L93 Difference]: Finished difference Result 10779 states and 14927 transitions. [2025-01-08 22:48:37,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:37,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 490 [2025-01-08 22:48:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:37,028 INFO L225 Difference]: With dead ends: 10779 [2025-01-08 22:48:37,028 INFO L226 Difference]: Without dead ends: 6065 [2025-01-08 22:48:37,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-08 22:48:37,034 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 38 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:37,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 199 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6065 states. [2025-01-08 22:48:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6065 to 6065. [2025-01-08 22:48:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6065 states, 6064 states have (on average 1.3794525065963061) internal successors, (8365), 6064 states have internal predecessors, (8365), 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-08 22:48:37,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6065 states to 6065 states and 8365 transitions. [2025-01-08 22:48:37,149 INFO L78 Accepts]: Start accepts. Automaton has 6065 states and 8365 transitions. Word has length 490 [2025-01-08 22:48:37,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:37,149 INFO L471 AbstractCegarLoop]: Abstraction has 6065 states and 8365 transitions. [2025-01-08 22:48:37,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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-08 22:48:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 6065 states and 8365 transitions. [2025-01-08 22:48:37,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2025-01-08 22:48:37,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:37,160 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:37,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:48:37,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:37,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:37,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1265407168, now seen corresponding path program 1 times [2025-01-08 22:48:37,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:37,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096226456] [2025-01-08 22:48:37,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:37,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 492 statements into 1 equivalence classes. [2025-01-08 22:48:37,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 492 of 492 statements. [2025-01-08 22:48:37,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:37,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3000 backedges. 1599 proven. 0 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2025-01-08 22:48:37,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:37,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096226456] [2025-01-08 22:48:37,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096226456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:48:37,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:48:37,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:48:37,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955805082] [2025-01-08 22:48:37,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:48:37,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:48:37,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:37,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:48:37,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:48:37,289 INFO L87 Difference]: Start difference. First operand 6065 states and 8365 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-08 22:48:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:37,416 INFO L93 Difference]: Finished difference Result 12010 states and 16503 transitions. [2025-01-08 22:48:37,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:48:37,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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 492 [2025-01-08 22:48:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:37,427 INFO L225 Difference]: With dead ends: 12010 [2025-01-08 22:48:37,428 INFO L226 Difference]: Without dead ends: 5963 [2025-01-08 22:48:37,433 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-08 22:48:37,434 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:37,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 265 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:48:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2025-01-08 22:48:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 5963. [2025-01-08 22:48:37,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5963 states, 5962 states have (on average 1.350888963435089) internal successors, (8054), 5962 states have internal predecessors, (8054), 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-08 22:48:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5963 states to 5963 states and 8054 transitions. [2025-01-08 22:48:37,587 INFO L78 Accepts]: Start accepts. Automaton has 5963 states and 8054 transitions. Word has length 492 [2025-01-08 22:48:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:37,588 INFO L471 AbstractCegarLoop]: Abstraction has 5963 states and 8054 transitions. [2025-01-08 22:48:37,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 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-08 22:48:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5963 states and 8054 transitions. [2025-01-08 22:48:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-01-08 22:48:37,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:37,600 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 16, 14, 14, 12, 12, 10, 10, 8, 8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 22:48:37,600 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:37,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 302810204, now seen corresponding path program 1 times [2025-01-08 22:48:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492729659] [2025-01-08 22:48:37,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:37,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-08 22:48:37,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-08 22:48:37,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:37,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3033 backedges. 1646 proven. 193 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2025-01-08 22:48:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492729659] [2025-01-08 22:48:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492729659] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958166622] [2025-01-08 22:48:37,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:48:37,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:37,962 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-08 22:48:37,964 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-08 22:48:38,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-01-08 22:48:38,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-01-08 22:48:38,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:48:38,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:38,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:48:38,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3033 backedges. 1694 proven. 226 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2025-01-08 22:48:39,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3033 backedges. 1783 proven. 137 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2025-01-08 22:48:40,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958166622] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:40,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:40,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-01-08 22:48:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086934613] [2025-01-08 22:48:40,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:40,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:48:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:40,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:48:40,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:48:40,100 INFO L87 Difference]: Start difference. First operand 5963 states and 8054 transitions. Second operand has 11 states, 11 states have (on average 37.0) internal successors, (407), 11 states have internal predecessors, (407), 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-08 22:48:41,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:41,843 INFO L93 Difference]: Finished difference Result 23977 states and 32310 transitions. [2025-01-08 22:48:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-08 22:48:41,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 37.0) internal successors, (407), 11 states have internal predecessors, (407), 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 494 [2025-01-08 22:48:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:41,867 INFO L225 Difference]: With dead ends: 23977 [2025-01-08 22:48:41,867 INFO L226 Difference]: Without dead ends: 17965 [2025-01-08 22:48:41,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2025-01-08 22:48:41,873 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 860 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 2365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:41,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1689 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-08 22:48:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17965 states. [2025-01-08 22:48:42,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17965 to 17375. [2025-01-08 22:48:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17375 states, 17374 states have (on average 1.3098883388972027) internal successors, (22758), 17374 states have internal predecessors, (22758), 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-08 22:48:42,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17375 states to 17375 states and 22758 transitions. [2025-01-08 22:48:42,115 INFO L78 Accepts]: Start accepts. Automaton has 17375 states and 22758 transitions. Word has length 494 [2025-01-08 22:48:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:42,116 INFO L471 AbstractCegarLoop]: Abstraction has 17375 states and 22758 transitions. [2025-01-08 22:48:42,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.0) internal successors, (407), 11 states have internal predecessors, (407), 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-08 22:48:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 17375 states and 22758 transitions. [2025-01-08 22:48:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-01-08 22:48:42,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:48:42,175 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 18, 16, 16, 14, 14, 12, 12, 10, 10, 10, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:42,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:48:42,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-08 22:48:42,376 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:48:42,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:48:42,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1332967317, now seen corresponding path program 2 times [2025-01-08 22:48:42,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:48:42,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733403102] [2025-01-08 22:48:42,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:48:42,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:48:42,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 562 statements into 2 equivalence classes. [2025-01-08 22:48:42,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 562 of 562 statements. [2025-01-08 22:48:42,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:48:42,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3868 backedges. 1249 proven. 15 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2025-01-08 22:48:42,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:48:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733403102] [2025-01-08 22:48:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733403102] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:48:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579426137] [2025-01-08 22:48:42,535 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:48:42,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:48:42,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:48:42,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:48:42,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:48:42,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 562 statements into 2 equivalence classes. [2025-01-08 22:48:42,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 562 of 562 statements. [2025-01-08 22:48:42,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:48:42,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:48:42,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:48:42,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:48:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3868 backedges. 1249 proven. 15 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2025-01-08 22:48:42,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:48:42,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3868 backedges. 1249 proven. 15 refuted. 0 times theorem prover too weak. 2604 trivial. 0 not checked. [2025-01-08 22:48:42,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579426137] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:48:42,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:48:42,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-08 22:48:42,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198461941] [2025-01-08 22:48:42,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:48:42,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 22:48:42,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:48:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 22:48:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-08 22:48:42,829 INFO L87 Difference]: Start difference. First operand 17375 states and 22758 transitions. Second operand has 8 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 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-08 22:48:43,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:48:43,280 INFO L93 Difference]: Finished difference Result 25348 states and 33056 transitions. [2025-01-08 22:48:43,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-08 22:48:43,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 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 562 [2025-01-08 22:48:43,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:48:43,282 INFO L225 Difference]: With dead ends: 25348 [2025-01-08 22:48:43,282 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:48:43,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1134 GetRequests, 1124 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:48:43,293 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 253 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:48:43,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 841 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:48:43,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:48:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:48:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-08 22:48:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:48:43,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 562 [2025-01-08 22:48:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:48:43,295 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:48:43,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 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-08 22:48:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:48:43,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:48:43,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:48:43,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:48:43,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-08 22:48:43,500 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:48:43,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:48:49,553 WARN L286 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 686 DAG size of output: 517 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-08 22:48:52,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:48:52,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:48:52 BoogieIcfgContainer [2025-01-08 22:48:52,573 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:48:52,574 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:48:52,574 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:48:52,574 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:48:52,578 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:48:29" (3/4) ... [2025-01-08 22:48:52,579 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:48:52,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-01-08 22:48:52,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:48:52,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:48:52,592 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:48:52,689 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:48:52,689 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:48:52,689 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:48:52,691 INFO L158 Benchmark]: Toolchain (without parser) took 24161.50ms. Allocated memory was 142.6MB in the beginning and 813.7MB in the end (delta: 671.1MB). Free memory was 112.7MB in the beginning and 597.0MB in the end (delta: -484.2MB). Peak memory consumption was 188.5MB. Max. memory is 16.1GB. [2025-01-08 22:48:52,691 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 124.6MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:52,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.89ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 97.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:48:52,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 93.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:48:52,692 INFO L158 Benchmark]: Boogie Preprocessor took 54.56ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:48:52,692 INFO L158 Benchmark]: RCFGBuilder took 512.53ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 51.4MB in the end (delta: 39.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 22:48:52,692 INFO L158 Benchmark]: TraceAbstraction took 23161.06ms. Allocated memory was 142.6MB in the beginning and 813.7MB in the end (delta: 671.1MB). Free memory was 50.3MB in the beginning and 609.5MB in the end (delta: -559.2MB). Peak memory consumption was 468.1MB. Max. memory is 16.1GB. [2025-01-08 22:48:52,692 INFO L158 Benchmark]: Witness Printer took 115.82ms. Allocated memory is still 813.7MB. Free memory was 609.5MB in the beginning and 597.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:48:52,693 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory was 124.9MB in the beginning and 124.6MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.89ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 97.2MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.00ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 93.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.56ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 92.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 512.53ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 51.4MB in the end (delta: 39.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23161.06ms. Allocated memory was 142.6MB in the beginning and 813.7MB in the end (delta: 671.1MB). Free memory was 50.3MB in the beginning and 609.5MB in the end (delta: -559.2MB). Peak memory consumption was 468.1MB. Max. memory is 16.1GB. * Witness Printer took 115.82ms. Allocated memory is still 813.7MB. Free memory was 609.5MB in the beginning and 597.0MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 679]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 22, TraceHistogramMax: 21, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2634 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2634 mSDsluCounter, 10356 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5175 mSDsCounter, 440 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5599 IncrementalHoareTripleChecker+Invalid, 6039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 440 mSolverCounterUnsat, 5181 mSDtfsCounter, 5599 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3858 GetRequests, 3793 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17375occurred in iteration=21, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 6116 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 7592 NumberOfCodeBlocks, 7592 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 9264 ConstructedInterpolants, 0 QuantifiedInterpolants, 18845 SizeOfPredicates, 5 NumberOfNonLiveVariables, 3276 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 18 PerfectInterpolantSequences, 41220/41966 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8466 == s__state)) && (2 == blastFlag)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576)) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (blastFlag == 1)) && (s__state <= 8448)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576))) || ((blastFlag == 1) && ((1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))) || (((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4249)))) || (((((2 == blastFlag) && (8497 <= s__s3__tmp__next_state___0)) && ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) + 4294967296) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))) && (1073741824 <= ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) || (((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))))) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || ((((3 == blastFlag) && (8640 <= s__s3__tmp__next_state___0)) && (8640 <= s__state)) && (0 != s__hit))) || ((((s__s3__tmp__next_state___0 <= 8495) && (s__state <= 8496)) && (2 == blastFlag)) && ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) + 4294967296) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))) && (1073741824 <= ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) || (((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y)))))) || ((2 == blastFlag) && (0 != s__hit))) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8673 != s__state)) && (2 == blastFlag)) && (s__state != 8672)) && (8640 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576))) || (((((8672 <= s__state) && ((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))))) && (8673 != s__state)) && (3 == blastFlag)) && (s__s3__tmp__next_state___0 <= 8576))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (s__state <= 8448)) && (8497 <= s__s3__tmp__next_state___0)) && (s__s3__tmp__next_state___0 <= 8576))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8544 == s__state))) || (((blastFlag == 1) && (s__state <= 8448)) && (3 == s__s3__tmp__next_state___0))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8466 == s__state)) && (blastFlag == 1))) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8497 <= s__s3__tmp__next_state___0)) && (8497 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || (((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (8673 != s__state)) && (blastFlag == 1)) && (8640 <= s__state))) || (((8672 <= s__state) && (8673 != s__state)) && (blastFlag == 1))) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8497 <= s__s3__tmp__next_state___0)) && (8512 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8655))) || (((s__state == 8528) && ((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))))) && (2 == blastFlag))) || ((((s__s3__tmp__next_state___0 <= 8495) && (2 == blastFlag)) && (s__state <= 8495)) && ((1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648))) || (((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4249)))) || ((((3 == blastFlag) && (8640 <= s__s3__tmp__next_state___0)) && (s__state <= 8448)) && (0 != s__hit))) || (((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (blastFlag == 1)) && (8512 <= s__state)) && (s__state <= 8655))) || ((blastFlag == 1) && (((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) / 2147483648) : ((((long long) ag_X + ag_Y) / 2147483648) - 1)) * 4294967296) + s__state) == (((long long) 2 * ag_X) + ((long long) 2 * ag_Y))))) || ((blastFlag == 1) && (0 != s__hit))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (8560 == s__state))) || ((((8672 <= s__state) && (8673 != s__state)) && (3 == blastFlag)) && (0 != s__hit))) || ((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (2 == blastFlag)) && (s__state == 8512))) || (blastFlag == 0)) || (((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (blastFlag == 1)) && (8497 <= s__s3__tmp__next_state___0)) && (8497 <= s__state)) && (s__s3__tmp__next_state___0 <= 8576)) && (s__state <= 8576))) || ((((((((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)) < 4328) || (1073741823 < ((((long long) ag_X + ag_Y) >= 0) ? (((long long) ag_X + ag_Y) % 2147483648) : ((((long long) ag_X + ag_Y) % 2147483648) + 2147483648)))) && (3 == blastFlag)) && (s__state <= 8448)) && (3 == s__s3__tmp__next_state___0)) && (0 == s__hit))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:48:52,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE