./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.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 c91ca4899b5af8ca28cd56fdb53af71cf5c86f932b323279b0b6773f1f060e71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:31:55,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:31:55,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:31:55,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:31:55,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:31:55,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:31:55,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:31:55,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:31:55,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:31:55,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:31:55,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:31:55,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:31:55,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:31:55,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:31:55,321 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:31:55,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:31:55,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:31:55,322 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:31:55,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:31:55,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:31:55,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:31:55,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:31:55,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:31:55,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:31:55,323 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:31:55,323 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:31:55,323 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:31:55,323 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:31:55,323 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:31:55,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:31:55,324 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:31:55,324 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:31:55,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:31:55,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:31:55,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:31:55,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:31:55,325 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:31:55,325 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:31:55,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:31:55,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:31:55,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:31:55,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:31:55,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:31:55,325 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 -> c91ca4899b5af8ca28cd56fdb53af71cf5c86f932b323279b0b6773f1f060e71 [2025-02-05 17:31:55,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:31:55,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:31:55,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:31:55,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:31:55,613 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:31:55,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2025-02-05 17:31:56,968 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f6bd5e71/d6c9fec02b1f4bba9d1184727dd1916e/FLAGc35a559f5 [2025-02-05 17:31:57,445 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:31:57,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2025-02-05 17:31:57,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f6bd5e71/d6c9fec02b1f4bba9d1184727dd1916e/FLAGc35a559f5 [2025-02-05 17:31:57,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4f6bd5e71/d6c9fec02b1f4bba9d1184727dd1916e [2025-02-05 17:31:57,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:31:57,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:31:57,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:31:57,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:31:57,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:31:57,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:31:57" (1/1) ... [2025-02-05 17:31:57,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a6a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:57, skipping insertion in model container [2025-02-05 17:31:57,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:31:57" (1/1) ... [2025-02-05 17:31:57,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:31:57,962 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[6391,6404] [2025-02-05 17:31:58,027 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[13452,13465] [2025-02-05 17:31:58,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:31:58,636 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:31:58,672 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[6391,6404] [2025-02-05 17:31:58,683 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/combinations/pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c[13452,13465] [2025-02-05 17:31:59,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:31:59,037 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:31:59,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59 WrapperNode [2025-02-05 17:31:59,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:31:59,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:31:59,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:31:59,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:31:59,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,469 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4978 [2025-02-05 17:31:59,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:31:59,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:31:59,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:31:59,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:31:59,479 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,706 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-02-05 17:31:59,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:31:59,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:31:59,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:31:59,993 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:31:59,993 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:31:59,994 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (1/1) ... [2025-02-05 17:32:00,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:32:00,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:32:00,030 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-02-05 17:32:00,033 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-02-05 17:32:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:32:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:32:00,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:32:00,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:32:00,163 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:32:00,165 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:32:04,879 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1984: havoc calculate_output_#t~ret30#1; [2025-02-05 17:32:04,880 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3463: havoc calculate_output2_#t~ret31#1; [2025-02-05 17:32:04,880 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4953: havoc calculate_output3_#t~ret32#1; [2025-02-05 17:32:05,142 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2025-02-05 17:32:05,143 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:32:05,191 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:32:05,191 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:32:05,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:32:05 BoogieIcfgContainer [2025-02-05 17:32:05,195 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:32:05,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:32:05,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:32:05,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:32:05,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:31:57" (1/3) ... [2025-02-05 17:32:05,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9a3d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:32:05, skipping insertion in model container [2025-02-05 17:32:05,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:31:59" (2/3) ... [2025-02-05 17:32:05,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9a3d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:32:05, skipping insertion in model container [2025-02-05 17:32:05,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:32:05" (3/3) ... [2025-02-05 17:32:05,205 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c [2025-02-05 17:32:05,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:32:05,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals+Problem12_label04.c that has 1 procedures, 871 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-02-05 17:32:05,321 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:32:05,337 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;@9931cab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:32:05,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:32:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 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-02-05 17:32:05,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:32:05,356 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:05,356 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] [2025-02-05 17:32:05,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:05,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:05,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1636970803, now seen corresponding path program 1 times [2025-02-05 17:32:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:05,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050330607] [2025-02-05 17:32:05,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:05,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:32:05,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:32:05,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:05,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:05,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:05,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:05,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050330607] [2025-02-05 17:32:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050330607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:32:05,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545852031] [2025-02-05 17:32:05,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:05,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 17:32:05,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:05,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 17:32:05,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:32:05,628 INFO L87 Difference]: Start difference. First operand has 871 states, 868 states have (on average 1.9055299539170507) internal successors, (1654), 870 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:32:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:05,724 INFO L93 Difference]: Finished difference Result 1720 states and 3268 transitions. [2025-02-05 17:32:05,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 17:32:05,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 17:32:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:05,747 INFO L225 Difference]: With dead ends: 1720 [2025-02-05 17:32:05,748 INFO L226 Difference]: Without dead ends: 806 [2025-02-05 17:32:05,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 17:32:05,759 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:05,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1590 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-02-05 17:32:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 806. [2025-02-05 17:32:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8955223880597014) internal successors, (1524), 805 states have internal predecessors, (1524), 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-02-05 17:32:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1524 transitions. [2025-02-05 17:32:05,841 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1524 transitions. Word has length 20 [2025-02-05 17:32:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:05,842 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1524 transitions. [2025-02-05 17:32:05,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:32:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1524 transitions. [2025-02-05 17:32:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 17:32:05,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:05,843 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] [2025-02-05 17:32:05,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:32:05,844 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:05,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1131412178, now seen corresponding path program 1 times [2025-02-05 17:32:05,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:05,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925011332] [2025-02-05 17:32:05,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:05,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:05,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 17:32:05,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 17:32:05,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:05,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:06,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925011332] [2025-02-05 17:32:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925011332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:06,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:32:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636723165] [2025-02-05 17:32:06,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:06,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:32:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:06,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:32:06,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:32:06,032 INFO L87 Difference]: Start difference. First operand 806 states and 1524 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:32:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:06,160 INFO L93 Difference]: Finished difference Result 870 states and 1622 transitions. [2025-02-05 17:32:06,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:32:06,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-05 17:32:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:06,167 INFO L225 Difference]: With dead ends: 870 [2025-02-05 17:32:06,170 INFO L226 Difference]: Without dead ends: 836 [2025-02-05 17:32:06,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-05 17:32:06,171 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 46 mSDsluCounter, 4538 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 6058 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:06,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 6058 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:32:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-02-05 17:32:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 806. [2025-02-05 17:32:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 804 states have (on average 1.8756218905472637) internal successors, (1508), 805 states have internal predecessors, (1508), 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-02-05 17:32:06,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1508 transitions. [2025-02-05 17:32:06,219 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1508 transitions. Word has length 20 [2025-02-05 17:32:06,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:06,221 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1508 transitions. [2025-02-05 17:32:06,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:32:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1508 transitions. [2025-02-05 17:32:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 17:32:06,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:06,223 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] [2025-02-05 17:32:06,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:32:06,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:06,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 784018818, now seen corresponding path program 1 times [2025-02-05 17:32:06,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:06,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227377020] [2025-02-05 17:32:06,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:06,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:06,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 17:32:06,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 17:32:06,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:06,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227377020] [2025-02-05 17:32:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227377020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:32:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046158798] [2025-02-05 17:32:06,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:06,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:32:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:06,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:32:06,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:32:06,440 INFO L87 Difference]: Start difference. First operand 806 states and 1508 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-02-05 17:32:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:06,587 INFO L93 Difference]: Finished difference Result 986 states and 1790 transitions. [2025-02-05 17:32:06,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 17:32:06,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2025-02-05 17:32:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:06,596 INFO L225 Difference]: With dead ends: 986 [2025-02-05 17:32:06,596 INFO L226 Difference]: Without dead ends: 956 [2025-02-05 17:32:06,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:32:06,598 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 4589 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4589 SdHoareTripleChecker+Valid, 1865 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:06,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4589 Valid, 1865 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:32:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-02-05 17:32:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 834. [2025-02-05 17:32:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 832 states have (on average 1.8653846153846154) internal successors, (1552), 833 states have internal predecessors, (1552), 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-02-05 17:32:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1552 transitions. [2025-02-05 17:32:06,635 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1552 transitions. Word has length 35 [2025-02-05 17:32:06,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:06,635 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1552 transitions. [2025-02-05 17:32:06,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-02-05 17:32:06,635 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1552 transitions. [2025-02-05 17:32:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:32:06,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:06,636 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] [2025-02-05 17:32:06,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:32:06,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:06,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:06,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1351806755, now seen corresponding path program 1 times [2025-02-05 17:32:06,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:06,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670025658] [2025-02-05 17:32:06,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:06,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:06,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:32:06,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:32:06,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:06,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670025658] [2025-02-05 17:32:06,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670025658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:06,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:06,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:32:06,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581424434] [2025-02-05 17:32:06,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:06,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:32:06,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:06,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:32:06,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:32:06,759 INFO L87 Difference]: Start difference. First operand 834 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-05 17:32:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:06,800 INFO L93 Difference]: Finished difference Result 939 states and 1715 transitions. [2025-02-05 17:32:06,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:32:06,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2025-02-05 17:32:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:06,805 INFO L225 Difference]: With dead ends: 939 [2025-02-05 17:32:06,806 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 17:32:06,806 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-02-05 17:32:06,807 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 1466 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:06,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1548 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 17:32:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-02-05 17:32:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.847206385404789) internal successors, (1620), 878 states have internal predecessors, (1620), 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-02-05 17:32:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1620 transitions. [2025-02-05 17:32:06,843 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1620 transitions. Word has length 37 [2025-02-05 17:32:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:06,843 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1620 transitions. [2025-02-05 17:32:06,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-05 17:32:06,844 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1620 transitions. [2025-02-05 17:32:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 17:32:06,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:06,847 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] [2025-02-05 17:32:06,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:32:06,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:06,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1319483520, now seen corresponding path program 1 times [2025-02-05 17:32:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:06,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661050469] [2025-02-05 17:32:06,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:06,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:06,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 17:32:06,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 17:32:06,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:06,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:07,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661050469] [2025-02-05 17:32:07,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661050469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:07,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:07,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:32:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702552370] [2025-02-05 17:32:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:07,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:32:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:07,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:32:07,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:32:07,150 INFO L87 Difference]: Start difference. First operand 879 states and 1620 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-02-05 17:32:07,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:07,231 INFO L93 Difference]: Finished difference Result 984 states and 1780 transitions. [2025-02-05 17:32:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:32:07,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2025-02-05 17:32:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:07,236 INFO L225 Difference]: With dead ends: 984 [2025-02-05 17:32:07,236 INFO L226 Difference]: Without dead ends: 881 [2025-02-05 17:32:07,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:32:07,239 INFO L435 NwaCegarLoop]: 1503 mSDtfsCounter, 1475 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:07,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1632 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-02-05 17:32:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2025-02-05 17:32:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 877 states have (on average 1.8449258836944127) internal successors, (1618), 878 states have internal predecessors, (1618), 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-02-05 17:32:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1618 transitions. [2025-02-05 17:32:07,267 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1618 transitions. Word has length 37 [2025-02-05 17:32:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:07,269 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1618 transitions. [2025-02-05 17:32:07,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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-02-05 17:32:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1618 transitions. [2025-02-05 17:32:07,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 17:32:07,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:07,270 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] [2025-02-05 17:32:07,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:32:07,270 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:07,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:07,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2076221574, now seen corresponding path program 1 times [2025-02-05 17:32:07,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:07,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530378681] [2025-02-05 17:32:07,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:07,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:07,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 17:32:07,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 17:32:07,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:07,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:07,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:07,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530378681] [2025-02-05 17:32:07,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530378681] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:07,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:07,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 17:32:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864864343] [2025-02-05 17:32:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:07,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 17:32:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:07,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 17:32:07,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:32:07,534 INFO L87 Difference]: Start difference. First operand 879 states and 1618 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-02-05 17:32:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:07,613 INFO L93 Difference]: Finished difference Result 887 states and 1627 transitions. [2025-02-05 17:32:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 17:32:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 38 [2025-02-05 17:32:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:07,619 INFO L225 Difference]: With dead ends: 887 [2025-02-05 17:32:07,619 INFO L226 Difference]: Without dead ends: 885 [2025-02-05 17:32:07,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 17:32:07,622 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 0 mSDsluCounter, 8996 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10498 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:07,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10498 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:07,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-02-05 17:32:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2025-02-05 17:32:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 883 states have (on average 1.838052095130238) internal successors, (1623), 884 states have internal predecessors, (1623), 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-02-05 17:32:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1623 transitions. [2025-02-05 17:32:07,647 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1623 transitions. Word has length 38 [2025-02-05 17:32:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:07,648 INFO L471 AbstractCegarLoop]: Abstraction has 885 states and 1623 transitions. [2025-02-05 17:32:07,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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-02-05 17:32:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1623 transitions. [2025-02-05 17:32:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:32:07,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:07,650 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] [2025-02-05 17:32:07,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:32:07,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:07,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2103070882, now seen corresponding path program 1 times [2025-02-05 17:32:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:07,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486474204] [2025-02-05 17:32:07,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:07,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:32:07,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:32:07,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:07,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:07,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:07,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:07,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486474204] [2025-02-05 17:32:07,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486474204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:07,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:07,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:32:07,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506628547] [2025-02-05 17:32:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:07,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:32:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:07,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:32:07,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:32:07,720 INFO L87 Difference]: Start difference. First operand 885 states and 1623 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-05 17:32:07,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:07,749 INFO L93 Difference]: Finished difference Result 1007 states and 1804 transitions. [2025-02-05 17:32:07,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:32:07,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2025-02-05 17:32:07,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:07,754 INFO L225 Difference]: With dead ends: 1007 [2025-02-05 17:32:07,754 INFO L226 Difference]: Without dead ends: 943 [2025-02-05 17:32:07,755 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-02-05 17:32:07,755 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1476 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:07,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1588 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-02-05 17:32:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 941. [2025-02-05 17:32:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 939 states have (on average 1.8146964856230032) internal successors, (1704), 940 states have internal predecessors, (1704), 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-02-05 17:32:07,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1704 transitions. [2025-02-05 17:32:07,781 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1704 transitions. Word has length 39 [2025-02-05 17:32:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:07,781 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1704 transitions. [2025-02-05 17:32:07,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-05 17:32:07,782 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1704 transitions. [2025-02-05 17:32:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:32:07,782 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:07,783 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] [2025-02-05 17:32:07,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:32:07,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:07,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1687895010, now seen corresponding path program 1 times [2025-02-05 17:32:07,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:07,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359437790] [2025-02-05 17:32:07,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:07,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:07,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:32:07,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:32:07,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:07,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:07,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:07,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:07,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359437790] [2025-02-05 17:32:07,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359437790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:07,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:07,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:32:07,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914412934] [2025-02-05 17:32:07,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:07,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:32:07,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:07,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:32:07,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:32:07,835 INFO L87 Difference]: Start difference. First operand 941 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-05 17:32:07,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:07,865 INFO L93 Difference]: Finished difference Result 1243 states and 2144 transitions. [2025-02-05 17:32:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:32:07,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2025-02-05 17:32:07,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:07,873 INFO L225 Difference]: With dead ends: 1243 [2025-02-05 17:32:07,873 INFO L226 Difference]: Without dead ends: 1080 [2025-02-05 17:32:07,874 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-02-05 17:32:07,875 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 1474 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:07,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1594 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2025-02-05 17:32:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1078. [2025-02-05 17:32:07,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1076 states have (on average 1.762081784386617) internal successors, (1896), 1077 states have internal predecessors, (1896), 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-02-05 17:32:07,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1896 transitions. [2025-02-05 17:32:07,904 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1896 transitions. Word has length 39 [2025-02-05 17:32:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:07,908 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1896 transitions. [2025-02-05 17:32:07,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-05 17:32:07,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1896 transitions. [2025-02-05 17:32:07,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 17:32:07,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:07,908 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] [2025-02-05 17:32:07,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:32:07,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:07,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 2120354014, now seen corresponding path program 1 times [2025-02-05 17:32:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:07,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563854858] [2025-02-05 17:32:07,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:07,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:07,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 17:32:07,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 17:32:07,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:07,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:07,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563854858] [2025-02-05 17:32:07,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563854858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:07,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:07,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:32:07,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763612722] [2025-02-05 17:32:07,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:07,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:32:07,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:07,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:32:07,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:32:07,959 INFO L87 Difference]: Start difference. First operand 1078 states and 1896 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-05 17:32:07,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:07,993 INFO L93 Difference]: Finished difference Result 1630 states and 2678 transitions. [2025-02-05 17:32:07,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:32:07,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2025-02-05 17:32:07,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:08,000 INFO L225 Difference]: With dead ends: 1630 [2025-02-05 17:32:08,001 INFO L226 Difference]: Without dead ends: 1330 [2025-02-05 17:32:08,001 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-02-05 17:32:08,002 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 1472 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:08,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1596 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-02-05 17:32:08,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1328. [2025-02-05 17:32:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6832579185520362) internal successors, (2232), 1327 states have internal predecessors, (2232), 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-02-05 17:32:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2232 transitions. [2025-02-05 17:32:08,041 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2232 transitions. Word has length 39 [2025-02-05 17:32:08,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:08,041 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2232 transitions. [2025-02-05 17:32:08,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-02-05 17:32:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2232 transitions. [2025-02-05 17:32:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:32:08,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:08,042 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:32:08,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:32:08,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:08,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash 900512759, now seen corresponding path program 1 times [2025-02-05 17:32:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261471825] [2025-02-05 17:32:08,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:08,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:08,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:32:08,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:32:08,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:08,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:32:08,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:08,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261471825] [2025-02-05 17:32:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261471825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:32:08,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675757110] [2025-02-05 17:32:08,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:08,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:32:08,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:08,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:32:08,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:32:08,201 INFO L87 Difference]: Start difference. First operand 1328 states and 2232 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-02-05 17:32:08,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:08,318 INFO L93 Difference]: Finished difference Result 2960 states and 4508 transitions. [2025-02-05 17:32:08,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:32:08,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 54 [2025-02-05 17:32:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:08,332 INFO L225 Difference]: With dead ends: 2960 [2025-02-05 17:32:08,332 INFO L226 Difference]: Without dead ends: 2558 [2025-02-05 17:32:08,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:32:08,337 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3037 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3037 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:08,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3037 Valid, 3172 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:08,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2025-02-05 17:32:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1804. [2025-02-05 17:32:08,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1802 states have (on average 1.602663706992231) internal successors, (2888), 1803 states have internal predecessors, (2888), 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-02-05 17:32:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2888 transitions. [2025-02-05 17:32:08,399 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2888 transitions. Word has length 54 [2025-02-05 17:32:08,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:08,399 INFO L471 AbstractCegarLoop]: Abstraction has 1804 states and 2888 transitions. [2025-02-05 17:32:08,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-02-05 17:32:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2888 transitions. [2025-02-05 17:32:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:32:08,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:08,401 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:32:08,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:32:08,402 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:08,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:08,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1315688631, now seen corresponding path program 1 times [2025-02-05 17:32:08,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:08,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387368783] [2025-02-05 17:32:08,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:08,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:08,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:32:08,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:32:08,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:08,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 17:32:08,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387368783] [2025-02-05 17:32:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387368783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:08,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:08,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:32:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907637704] [2025-02-05 17:32:08,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:08,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:32:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:08,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:32:08,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:32:08,529 INFO L87 Difference]: Start difference. First operand 1804 states and 2888 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-02-05 17:32:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:08,634 INFO L93 Difference]: Finished difference Result 3508 states and 5268 transitions. [2025-02-05 17:32:08,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:32:08,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 54 [2025-02-05 17:32:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:08,647 INFO L225 Difference]: With dead ends: 3508 [2025-02-05 17:32:08,648 INFO L226 Difference]: Without dead ends: 2958 [2025-02-05 17:32:08,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:32:08,651 INFO L435 NwaCegarLoop]: 1547 mSDtfsCounter, 3041 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3041 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:08,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3041 Valid, 3147 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2025-02-05 17:32:08,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2552. [2025-02-05 17:32:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2552 states, 2550 states have (on average 1.5356862745098039) internal successors, (3916), 2551 states have internal predecessors, (3916), 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-02-05 17:32:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3916 transitions. [2025-02-05 17:32:08,726 INFO L78 Accepts]: Start accepts. Automaton has 2552 states and 3916 transitions. Word has length 54 [2025-02-05 17:32:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:08,727 INFO L471 AbstractCegarLoop]: Abstraction has 2552 states and 3916 transitions. [2025-02-05 17:32:08,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-02-05 17:32:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2552 states and 3916 transitions. [2025-02-05 17:32:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 17:32:08,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:08,729 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:32:08,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:32:08,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:08,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash 828970359, now seen corresponding path program 1 times [2025-02-05 17:32:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088545403] [2025-02-05 17:32:08,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:08,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:08,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 17:32:08,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 17:32:08,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:08,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 17:32:08,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:08,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088545403] [2025-02-05 17:32:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088545403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:08,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:32:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072947543] [2025-02-05 17:32:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:08,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:32:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:08,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:32:08,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:32:08,831 INFO L87 Difference]: Start difference. First operand 2552 states and 3916 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-02-05 17:32:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:08,937 INFO L93 Difference]: Finished difference Result 4056 states and 6024 transitions. [2025-02-05 17:32:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:32:08,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 54 [2025-02-05 17:32:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:08,950 INFO L225 Difference]: With dead ends: 4056 [2025-02-05 17:32:08,950 INFO L226 Difference]: Without dead ends: 3506 [2025-02-05 17:32:08,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 17:32:08,952 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 3047 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 3153 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:08,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 3153 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2025-02-05 17:32:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3100. [2025-02-05 17:32:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.5080697224015494) internal successors, (4672), 3099 states have internal predecessors, (4672), 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-02-05 17:32:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4672 transitions. [2025-02-05 17:32:09,033 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4672 transitions. Word has length 54 [2025-02-05 17:32:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:09,033 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4672 transitions. [2025-02-05 17:32:09,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-02-05 17:32:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4672 transitions. [2025-02-05 17:32:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 17:32:09,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:09,035 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] [2025-02-05 17:32:09,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:32:09,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:09,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash -357767785, now seen corresponding path program 1 times [2025-02-05 17:32:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:09,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774186120] [2025-02-05 17:32:09,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:09,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 17:32:09,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 17:32:09,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:09,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:09,128 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:09,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:09,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774186120] [2025-02-05 17:32:09,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774186120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:09,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:32:09,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249649226] [2025-02-05 17:32:09,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:09,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:32:09,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:09,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:32:09,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:32:09,132 INFO L87 Difference]: Start difference. First operand 3100 states and 4672 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:32:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:09,255 INFO L93 Difference]: Finished difference Result 5424 states and 7882 transitions. [2025-02-05 17:32:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:32:09,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-05 17:32:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:09,268 INFO L225 Difference]: With dead ends: 5424 [2025-02-05 17:32:09,268 INFO L226 Difference]: Without dead ends: 3102 [2025-02-05 17:32:09,271 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-02-05 17:32:09,272 INFO L435 NwaCegarLoop]: 1526 mSDtfsCounter, 29 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:09,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3022 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:09,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2025-02-05 17:32:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3100. [2025-02-05 17:32:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3100 states, 3098 states have (on average 1.4919302775984506) internal successors, (4622), 3099 states have internal predecessors, (4622), 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-02-05 17:32:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3100 states to 3100 states and 4622 transitions. [2025-02-05 17:32:09,351 INFO L78 Accepts]: Start accepts. Automaton has 3100 states and 4622 transitions. Word has length 55 [2025-02-05 17:32:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:09,352 INFO L471 AbstractCegarLoop]: Abstraction has 3100 states and 4622 transitions. [2025-02-05 17:32:09,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 17:32:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3100 states and 4622 transitions. [2025-02-05 17:32:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 17:32:09,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:09,353 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 17:32:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:32:09,353 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:09,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1485901451, now seen corresponding path program 1 times [2025-02-05 17:32:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410657087] [2025-02-05 17:32:09,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:09,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:09,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 17:32:09,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 17:32:09,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:09,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:09,439 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:09,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:09,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410657087] [2025-02-05 17:32:09,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410657087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:09,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:09,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:32:09,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038930464] [2025-02-05 17:32:09,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:09,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:32:09,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:09,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:32:09,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:32:09,441 INFO L87 Difference]: Start difference. First operand 3100 states and 4622 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 17:32:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:09,484 INFO L93 Difference]: Finished difference Result 4019 states and 5882 transitions. [2025-02-05 17:32:09,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:32:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2025-02-05 17:32:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:09,491 INFO L225 Difference]: With dead ends: 4019 [2025-02-05 17:32:09,492 INFO L226 Difference]: Without dead ends: 1697 [2025-02-05 17:32:09,494 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-02-05 17:32:09,495 INFO L435 NwaCegarLoop]: 1524 mSDtfsCounter, 23 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:09,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3019 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2025-02-05 17:32:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1689. [2025-02-05 17:32:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 1687 states have (on average 1.5986959098992295) internal successors, (2697), 1688 states have internal predecessors, (2697), 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-02-05 17:32:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2697 transitions. [2025-02-05 17:32:09,536 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2697 transitions. Word has length 56 [2025-02-05 17:32:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:09,537 INFO L471 AbstractCegarLoop]: Abstraction has 1689 states and 2697 transitions. [2025-02-05 17:32:09,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 17:32:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2697 transitions. [2025-02-05 17:32:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 17:32:09,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:09,538 INFO L218 NwaCegarLoop]: trace histogram [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, 1] [2025-02-05 17:32:09,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:32:09,539 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:09,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 505748734, now seen corresponding path program 1 times [2025-02-05 17:32:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411344394] [2025-02-05 17:32:09,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:09,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 17:32:09,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 17:32:09,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:09,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:09,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:09,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411344394] [2025-02-05 17:32:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411344394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:32:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058930660] [2025-02-05 17:32:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:09,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:32:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:09,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:32:09,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:32:09,617 INFO L87 Difference]: Start difference. First operand 1689 states and 2697 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-02-05 17:32:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:09,646 INFO L93 Difference]: Finished difference Result 2143 states and 3311 transitions. [2025-02-05 17:32:09,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:32:09,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2025-02-05 17:32:09,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:09,652 INFO L225 Difference]: With dead ends: 2143 [2025-02-05 17:32:09,653 INFO L226 Difference]: Without dead ends: 1241 [2025-02-05 17:32:09,654 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-02-05 17:32:09,655 INFO L435 NwaCegarLoop]: 1518 mSDtfsCounter, 25 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:09,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2998 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:32:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-02-05 17:32:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1239. [2025-02-05 17:32:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1237 states have (on average 1.6782538399353275) internal successors, (2076), 1238 states have internal predecessors, (2076), 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-02-05 17:32:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 2076 transitions. [2025-02-05 17:32:09,686 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 2076 transitions. Word has length 57 [2025-02-05 17:32:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:09,686 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 2076 transitions. [2025-02-05 17:32:09,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-02-05 17:32:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 2076 transitions. [2025-02-05 17:32:09,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 17:32:09,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:09,687 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2025-02-05 17:32:09,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:32:09,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:09,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1114797445, now seen corresponding path program 1 times [2025-02-05 17:32:09,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:09,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573251563] [2025-02-05 17:32:09,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:09,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:09,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 17:32:09,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 17:32:09,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:09,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573251563] [2025-02-05 17:32:10,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573251563] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:32:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673111988] [2025-02-05 17:32:10,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:10,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:10,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:32:10,172 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-02-05 17:32:10,174 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-02-05 17:32:10,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 17:32:10,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 17:32:10,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:10,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:10,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 17:32:10,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:32:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:32:10,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:32:10,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 17:32:10,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673111988] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:32:10,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:32:10,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2025-02-05 17:32:10,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195776482] [2025-02-05 17:32:10,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:32:10,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 17:32:10,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:10,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 17:32:10,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-02-05 17:32:10,748 INFO L87 Difference]: Start difference. First operand 1239 states and 2076 transitions. Second operand has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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-02-05 17:32:12,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:12,114 INFO L93 Difference]: Finished difference Result 3247 states and 4697 transitions. [2025-02-05 17:32:12,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 17:32:12,114 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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 59 [2025-02-05 17:32:12,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:12,127 INFO L225 Difference]: With dead ends: 3247 [2025-02-05 17:32:12,130 INFO L226 Difference]: Without dead ends: 2795 [2025-02-05 17:32:12,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=396, Invalid=1326, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 17:32:12,133 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 10929 mSDsluCounter, 6173 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10929 SdHoareTripleChecker+Valid, 7672 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:12,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10929 Valid, 7672 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:32:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2795 states. [2025-02-05 17:32:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2795 to 2677. [2025-02-05 17:32:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2675 states have (on average 1.4418691588785046) internal successors, (3857), 2676 states have internal predecessors, (3857), 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-02-05 17:32:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3857 transitions. [2025-02-05 17:32:12,228 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3857 transitions. Word has length 59 [2025-02-05 17:32:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:12,228 INFO L471 AbstractCegarLoop]: Abstraction has 2677 states and 3857 transitions. [2025-02-05 17:32:12,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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-02-05 17:32:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3857 transitions. [2025-02-05 17:32:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:32:12,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:12,230 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:32:12,241 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-02-05 17:32:12,430 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,SelfDestructingSolverStorable15 [2025-02-05 17:32:12,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:12,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash 420436844, now seen corresponding path program 1 times [2025-02-05 17:32:12,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:12,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272363707] [2025-02-05 17:32:12,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:12,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:32:12,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:32:12,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272363707] [2025-02-05 17:32:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272363707] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:32:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321660476] [2025-02-05 17:32:12,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:12,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:12,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:32:12,875 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-02-05 17:32:12,877 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-02-05 17:32:12,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:32:12,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:32:12,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:12,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:12,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 17:32:12,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:32:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:14,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:32:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:15,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321660476] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:32:15,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:32:15,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 30 [2025-02-05 17:32:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775067677] [2025-02-05 17:32:15,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:32:15,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 17:32:15,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:15,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 17:32:15,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2025-02-05 17:32:15,671 INFO L87 Difference]: Start difference. First operand 2677 states and 3857 transitions. Second operand has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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-02-05 17:32:17,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:17,211 INFO L93 Difference]: Finished difference Result 7356 states and 9793 transitions. [2025-02-05 17:32:17,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-05 17:32:17,211 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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 60 [2025-02-05 17:32:17,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:17,231 INFO L225 Difference]: With dead ends: 7356 [2025-02-05 17:32:17,231 INFO L226 Difference]: Without dead ends: 5869 [2025-02-05 17:32:17,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=758, Invalid=2322, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 17:32:17,237 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 14014 mSDsluCounter, 7643 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14014 SdHoareTripleChecker+Valid, 9130 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:17,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14014 Valid, 9130 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:32:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5869 states. [2025-02-05 17:32:17,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5869 to 5673. [2025-02-05 17:32:17,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5673 states, 5671 states have (on average 1.3299241756304003) internal successors, (7542), 5672 states have internal predecessors, (7542), 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-02-05 17:32:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5673 states to 5673 states and 7542 transitions. [2025-02-05 17:32:17,419 INFO L78 Accepts]: Start accepts. Automaton has 5673 states and 7542 transitions. Word has length 60 [2025-02-05 17:32:17,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:17,420 INFO L471 AbstractCegarLoop]: Abstraction has 5673 states and 7542 transitions. [2025-02-05 17:32:17,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.333333333333333) internal successors, (160), 30 states have internal predecessors, (160), 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-02-05 17:32:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 5673 states and 7542 transitions. [2025-02-05 17:32:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 17:32:17,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:17,421 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:32:17,430 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-02-05 17:32:17,625 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-02-05 17:32:17,626 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1592793716, now seen corresponding path program 1 times [2025-02-05 17:32:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:17,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352847257] [2025-02-05 17:32:17,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:17,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:32:17,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:32:17,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:17,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:18,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:18,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352847257] [2025-02-05 17:32:18,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352847257] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:32:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690503184] [2025-02-05 17:32:18,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:18,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:18,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:32:18,054 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-02-05 17:32:18,057 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-02-05 17:32:18,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 17:32:18,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 17:32:18,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:18,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:18,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 17:32:18,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:32:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:18,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:32:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690503184] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:32:19,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:32:19,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-05 17:32:19,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110639938] [2025-02-05 17:32:19,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:32:19,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 17:32:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:19,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 17:32:19,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-02-05 17:32:19,058 INFO L87 Difference]: Start difference. First operand 5673 states and 7542 transitions. Second operand has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 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-02-05 17:32:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:19,628 INFO L93 Difference]: Finished difference Result 11610 states and 15004 transitions. [2025-02-05 17:32:19,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 17:32:19,629 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 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 60 [2025-02-05 17:32:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:19,641 INFO L225 Difference]: With dead ends: 11610 [2025-02-05 17:32:19,641 INFO L226 Difference]: Without dead ends: 7484 [2025-02-05 17:32:19,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-02-05 17:32:19,648 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 13567 mSDsluCounter, 4673 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13567 SdHoareTripleChecker+Valid, 6175 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:19,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13567 Valid, 6175 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:32:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7484 states. [2025-02-05 17:32:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7484 to 7416. [2025-02-05 17:32:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7416 states, 7414 states have (on average 1.304154302670623) internal successors, (9669), 7415 states have internal predecessors, (9669), 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-02-05 17:32:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 9669 transitions. [2025-02-05 17:32:19,876 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 9669 transitions. Word has length 60 [2025-02-05 17:32:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:19,877 INFO L471 AbstractCegarLoop]: Abstraction has 7416 states and 9669 transitions. [2025-02-05 17:32:19,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 20 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-02-05 17:32:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 9669 transitions. [2025-02-05 17:32:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 17:32:19,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:19,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:32:19,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 17:32:20,082 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-02-05 17:32:20,082 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:20,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:20,083 INFO L85 PathProgramCache]: Analyzing trace with hash -315930300, now seen corresponding path program 1 times [2025-02-05 17:32:20,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:20,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520190186] [2025-02-05 17:32:20,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:20,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:20,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:32:20,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:32:20,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:20,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:20,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:20,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520190186] [2025-02-05 17:32:20,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520190186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:32:20,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:32:20,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 17:32:20,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671661140] [2025-02-05 17:32:20,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:32:20,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:32:20,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:20,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:32:20,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:32:20,142 INFO L87 Difference]: Start difference. First operand 7416 states and 9669 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-02-05 17:32:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:23,600 INFO L93 Difference]: Finished difference Result 8920 states and 12542 transitions. [2025-02-05 17:32:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:32:23,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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 61 [2025-02-05 17:32:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:23,617 INFO L225 Difference]: With dead ends: 8920 [2025-02-05 17:32:23,618 INFO L226 Difference]: Without dead ends: 8167 [2025-02-05 17:32:23,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-05 17:32:23,621 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 809 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:23,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 544 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 17:32:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2025-02-05 17:32:23,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8167. [2025-02-05 17:32:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8167 states, 8165 states have (on average 1.3041028781383956) internal successors, (10648), 8166 states have internal predecessors, (10648), 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-02-05 17:32:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 10648 transitions. [2025-02-05 17:32:23,833 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 10648 transitions. Word has length 61 [2025-02-05 17:32:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:23,834 INFO L471 AbstractCegarLoop]: Abstraction has 8167 states and 10648 transitions. [2025-02-05 17:32:23,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 2 states have internal predecessors, (61), 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-02-05 17:32:23,834 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 10648 transitions. [2025-02-05 17:32:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 17:32:23,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:23,835 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:32:23,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:32:23,837 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:23,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1045991069, now seen corresponding path program 1 times [2025-02-05 17:32:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:23,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407827540] [2025-02-05 17:32:23,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:23,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:32:23,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:32:23,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:23,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:24,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:24,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407827540] [2025-02-05 17:32:24,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407827540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:32:24,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395609404] [2025-02-05 17:32:24,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:24,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:24,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:32:24,601 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-02-05 17:32:24,604 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-02-05 17:32:24,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 17:32:24,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 17:32:24,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:24,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:24,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-05 17:32:24,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:32:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:26,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:32:27,993 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:27,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395609404] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:32:27,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:32:27,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 17] total 44 [2025-02-05 17:32:27,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292989986] [2025-02-05 17:32:27,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:32:27,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-02-05 17:32:27,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:27,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-02-05 17:32:27,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1629, Unknown=0, NotChecked=0, Total=1892 [2025-02-05 17:32:27,996 INFO L87 Difference]: Start difference. First operand 8167 states and 10648 transitions. Second operand has 44 states, 44 states have (on average 3.659090909090909) internal successors, (161), 44 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-02-05 17:32:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:39,575 INFO L93 Difference]: Finished difference Result 15855 states and 20234 transitions. [2025-02-05 17:32:39,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-02-05 17:32:39,575 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.659090909090909) internal successors, (161), 44 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 61 [2025-02-05 17:32:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:39,596 INFO L225 Difference]: With dead ends: 15855 [2025-02-05 17:32:39,596 INFO L226 Difference]: Without dead ends: 11878 [2025-02-05 17:32:39,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7754 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=4457, Invalid=16135, Unknown=0, NotChecked=0, Total=20592 [2025-02-05 17:32:39,606 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 9052 mSDsluCounter, 24700 mSDsCounter, 0 mSdLazyCounter, 1862 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9052 SdHoareTripleChecker+Valid, 26223 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:39,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9052 Valid, 26223 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1862 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 17:32:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2025-02-05 17:32:39,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 8247. [2025-02-05 17:32:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8247 states, 8245 states have (on average 1.303335354760461) internal successors, (10746), 8246 states have internal predecessors, (10746), 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-02-05 17:32:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8247 states to 8247 states and 10746 transitions. [2025-02-05 17:32:39,958 INFO L78 Accepts]: Start accepts. Automaton has 8247 states and 10746 transitions. Word has length 61 [2025-02-05 17:32:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:39,959 INFO L471 AbstractCegarLoop]: Abstraction has 8247 states and 10746 transitions. [2025-02-05 17:32:39,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.659090909090909) internal successors, (161), 44 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-02-05 17:32:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 8247 states and 10746 transitions. [2025-02-05 17:32:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 17:32:39,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:39,960 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-02-05 17:32:39,969 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-02-05 17:32:40,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:40,164 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:40,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1435836916, now seen corresponding path program 1 times [2025-02-05 17:32:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:40,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915048353] [2025-02-05 17:32:40,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:40,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:32:40,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:32:40,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:40,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:40,870 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:40,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:40,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915048353] [2025-02-05 17:32:40,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915048353] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:32:40,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772834795] [2025-02-05 17:32:40,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:40,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:40,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:32:40,873 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-02-05 17:32:40,876 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-02-05 17:32:40,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 17:32:40,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 17:32:40,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:40,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:40,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-05 17:32:40,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:32:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:41,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:32:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772834795] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:32:42,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:32:42,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2025-02-05 17:32:42,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125135469] [2025-02-05 17:32:42,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:32:42,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-05 17:32:42,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:42,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-05 17:32:42,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-02-05 17:32:42,538 INFO L87 Difference]: Start difference. First operand 8247 states and 10746 transitions. Second operand has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 33 states have internal predecessors, (145), 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-02-05 17:32:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:44,014 INFO L93 Difference]: Finished difference Result 12274 states and 15733 transitions. [2025-02-05 17:32:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 17:32:44,029 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 33 states have internal predecessors, (145), 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 62 [2025-02-05 17:32:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:44,044 INFO L225 Difference]: With dead ends: 12274 [2025-02-05 17:32:44,045 INFO L226 Difference]: Without dead ends: 8228 [2025-02-05 17:32:44,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=442, Invalid=1720, Unknown=0, NotChecked=0, Total=2162 [2025-02-05 17:32:44,054 INFO L435 NwaCegarLoop]: 1507 mSDtfsCounter, 13846 mSDsluCounter, 18308 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13846 SdHoareTripleChecker+Valid, 19815 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:44,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13846 Valid, 19815 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:32:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8228 states. [2025-02-05 17:32:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8228 to 5711. [2025-02-05 17:32:44,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5711 states, 5709 states have (on average 1.3380627080049046) internal successors, (7639), 5710 states have internal predecessors, (7639), 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-02-05 17:32:44,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5711 states to 5711 states and 7639 transitions. [2025-02-05 17:32:44,379 INFO L78 Accepts]: Start accepts. Automaton has 5711 states and 7639 transitions. Word has length 62 [2025-02-05 17:32:44,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:44,380 INFO L471 AbstractCegarLoop]: Abstraction has 5711 states and 7639 transitions. [2025-02-05 17:32:44,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.393939393939394) internal successors, (145), 33 states have internal predecessors, (145), 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-02-05 17:32:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 5711 states and 7639 transitions. [2025-02-05 17:32:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 17:32:44,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:44,382 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 17:32:44,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 17:32:44,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:44,583 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:44,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1483083885, now seen corresponding path program 1 times [2025-02-05 17:32:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008362900] [2025-02-05 17:32:44,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:44,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 17:32:44,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 17:32:44,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:44,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:45,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:45,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008362900] [2025-02-05 17:32:45,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008362900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:32:45,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169287780] [2025-02-05 17:32:45,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:45,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:45,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:32:45,491 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:32:45,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:32:45,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 17:32:45,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 17:32:45,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:45,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:45,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 17:32:45,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:32:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 27 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:46,416 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:32:47,746 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:47,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169287780] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:32:47,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:32:47,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 30 [2025-02-05 17:32:47,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296044252] [2025-02-05 17:32:47,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:32:47,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-05 17:32:47,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:47,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-05 17:32:47,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-02-05 17:32:47,749 INFO L87 Difference]: Start difference. First operand 5711 states and 7639 transitions. Second operand has 31 states, 31 states have (on average 7.645161290322581) internal successors, (237), 30 states have internal predecessors, (237), 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-02-05 17:32:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:32:49,313 INFO L93 Difference]: Finished difference Result 15047 states and 19447 transitions. [2025-02-05 17:32:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-02-05 17:32:49,314 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 7.645161290322581) internal successors, (237), 30 states have internal predecessors, (237), 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 99 [2025-02-05 17:32:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:32:49,327 INFO L225 Difference]: With dead ends: 15047 [2025-02-05 17:32:49,328 INFO L226 Difference]: Without dead ends: 11171 [2025-02-05 17:32:49,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=835, Invalid=2947, Unknown=0, NotChecked=0, Total=3782 [2025-02-05 17:32:49,338 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 20012 mSDsluCounter, 12267 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20012 SdHoareTripleChecker+Valid, 13803 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:32:49,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20012 Valid, 13803 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:32:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11171 states. [2025-02-05 17:32:49,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11171 to 10361. [2025-02-05 17:32:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10361 states, 10359 states have (on average 1.2831354377835698) internal successors, (13292), 10360 states have internal predecessors, (13292), 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-02-05 17:32:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10361 states to 10361 states and 13292 transitions. [2025-02-05 17:32:49,939 INFO L78 Accepts]: Start accepts. Automaton has 10361 states and 13292 transitions. Word has length 99 [2025-02-05 17:32:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:32:49,952 INFO L471 AbstractCegarLoop]: Abstraction has 10361 states and 13292 transitions. [2025-02-05 17:32:49,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 7.645161290322581) internal successors, (237), 30 states have internal predecessors, (237), 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-02-05 17:32:49,953 INFO L276 IsEmpty]: Start isEmpty. Operand 10361 states and 13292 transitions. [2025-02-05 17:32:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 17:32:49,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:32:49,961 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 17:32:49,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 17:32:50,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 17:32:50,162 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:32:50,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:32:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash -397254221, now seen corresponding path program 1 times [2025-02-05 17:32:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:32:50,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343775549] [2025-02-05 17:32:50,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:32:50,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 17:32:50,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 17:32:50,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:50,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:51,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:32:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343775549] [2025-02-05 17:32:51,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343775549] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:32:51,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728176054] [2025-02-05 17:32:51,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:32:51,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:32:51,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:32:51,663 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:32:51,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 17:32:51,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 17:32:51,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 17:32:51,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:32:51,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:32:51,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-05 17:32:51,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:32:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:55,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 17:32:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:32:59,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728176054] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 17:32:59,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 17:32:59,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 24] total 69 [2025-02-05 17:32:59,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313956783] [2025-02-05 17:32:59,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 17:32:59,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-02-05 17:32:59,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:32:59,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-02-05 17:32:59,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=4280, Unknown=0, NotChecked=0, Total=4692 [2025-02-05 17:32:59,780 INFO L87 Difference]: Start difference. First operand 10361 states and 13292 transitions. Second operand has 69 states, 69 states have (on average 4.086956521739131) internal successors, (282), 69 states have internal predecessors, (282), 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)