./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash a95ceeac0f165e2677b6b52117f2b2f85e3771ca9e25b04980e7e83596a8463f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:22:00,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:22:00,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 08:22:00,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:22:00,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:22:00,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:22:00,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:22:00,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:22:00,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:22:00,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:22:00,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:22:00,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:22:00,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:22:00,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:22:00,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:22:00,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:00,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:00,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:22:00,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:22:00,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:22:00,540 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a95ceeac0f165e2677b6b52117f2b2f85e3771ca9e25b04980e7e83596a8463f [2025-01-09 08:22:00,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:22:00,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:22:00,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:22:00,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:22:00,786 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:22:00,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p06.c [2025-01-09 08:22:01,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3ec7547f/b4875dbfb2e343f89893d399dd5aead2/FLAG1c0702132 [2025-01-09 08:22:02,276 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:22:02,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p06.c [2025-01-09 08:22:02,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3ec7547f/b4875dbfb2e343f89893d399dd5aead2/FLAG1c0702132 [2025-01-09 08:22:02,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3ec7547f/b4875dbfb2e343f89893d399dd5aead2 [2025-01-09 08:22:02,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:22:02,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:22:02,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:22:02,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:22:02,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:22:02,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:22:02" (1/1) ... [2025-01-09 08:22:02,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8b4c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:02, skipping insertion in model container [2025-01-09 08:22:02,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:22:02" (1/1) ... [2025-01-09 08:22:02,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:22:02,699 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p06.c[1259,1272] [2025-01-09 08:22:02,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:22:02,905 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:22:02,912 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsaR_p06.c[1259,1272] [2025-01-09 08:22:02,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:22:03,003 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:22:03,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03 WrapperNode [2025-01-09 08:22:03,005 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:22:03,006 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:22:03,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:22:03,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:22:03,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,217 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2150 [2025-01-09 08:22:03,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:22:03,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:22:03,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:22:03,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:22:03,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,309 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 08:22:03,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:22:03,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:22:03,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:22:03,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:22:03,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (1/1) ... [2025-01-09 08:22:03,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:22:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:22:03,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 08:22:03,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:22:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:22:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:22:03,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:22:03,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:22:03,763 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:22:03,765 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:22:05,536 INFO L? ?]: Removed 1351 outVars from TransFormulas that were not future-live. [2025-01-09 08:22:05,537 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:22:05,560 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:22:05,561 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:22:05,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:22:05 BoogieIcfgContainer [2025-01-09 08:22:05,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:22:05,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:22:05,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:22:05,567 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:22:05,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:22:02" (1/3) ... [2025-01-09 08:22:05,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efa40a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:22:05, skipping insertion in model container [2025-01-09 08:22:05,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:22:03" (2/3) ... [2025-01-09 08:22:05,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efa40a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:22:05, skipping insertion in model container [2025-01-09 08:22:05,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:22:05" (3/3) ... [2025-01-09 08:22:05,570 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsaR_p06.c [2025-01-09 08:22:05,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:22:05,582 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_vsaR_p06.c that has 1 procedures, 543 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:22:05,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:22:05,649 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;@d37b608, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:22:05,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:22:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 541 states have (on average 1.4990757855822552) internal successors, (811), 542 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 08:22:05,663 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:05,664 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] [2025-01-09 08:22:05,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:05,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1156434564, now seen corresponding path program 1 times [2025-01-09 08:22:05,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298687886] [2025-01-09 08:22:05,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:05,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:05,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 08:22:05,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 08:22:05,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:05,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:06,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:06,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298687886] [2025-01-09 08:22:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298687886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:06,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:06,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:22:06,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722766428] [2025-01-09 08:22:06,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:06,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:22:06,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:06,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:22:06,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:22:06,277 INFO L87 Difference]: Start difference. First operand has 543 states, 541 states have (on average 1.4990757855822552) internal successors, (811), 542 states have internal predecessors, (811), 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 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:06,349 INFO L93 Difference]: Finished difference Result 1031 states and 1543 transitions. [2025-01-09 08:22:06,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:22:06,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2025-01-09 08:22:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:06,362 INFO L225 Difference]: With dead ends: 1031 [2025-01-09 08:22:06,363 INFO L226 Difference]: Without dead ends: 542 [2025-01-09 08:22:06,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:22:06,369 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 0 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:06,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2409 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-01-09 08:22:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2025-01-09 08:22:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.4953789279112755) internal successors, (809), 541 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 809 transitions. [2025-01-09 08:22:06,427 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 809 transitions. Word has length 47 [2025-01-09 08:22:06,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:06,428 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 809 transitions. [2025-01-09 08:22:06,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:06,428 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 809 transitions. [2025-01-09 08:22:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 08:22:06,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:06,429 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] [2025-01-09 08:22:06,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:22:06,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:06,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:06,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1488037690, now seen corresponding path program 1 times [2025-01-09 08:22:06,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:06,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9390771] [2025-01-09 08:22:06,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:06,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:06,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 08:22:06,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 08:22:06,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:06,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:06,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:06,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9390771] [2025-01-09 08:22:06,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9390771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:06,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:06,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:22:06,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677302011] [2025-01-09 08:22:06,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:06,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:22:06,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:06,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:22:06,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:22:06,617 INFO L87 Difference]: Start difference. First operand 542 states and 809 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:06,656 INFO L93 Difference]: Finished difference Result 1032 states and 1541 transitions. [2025-01-09 08:22:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:22:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 48 [2025-01-09 08:22:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:06,659 INFO L225 Difference]: With dead ends: 1032 [2025-01-09 08:22:06,659 INFO L226 Difference]: Without dead ends: 544 [2025-01-09 08:22:06,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:22:06,665 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 0 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:06,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2405 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:06,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-01-09 08:22:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2025-01-09 08:22:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 1.4935543278084715) internal successors, (811), 543 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 811 transitions. [2025-01-09 08:22:06,685 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 811 transitions. Word has length 48 [2025-01-09 08:22:06,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:06,685 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 811 transitions. [2025-01-09 08:22:06,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 811 transitions. [2025-01-09 08:22:06,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 08:22:06,686 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:06,686 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] [2025-01-09 08:22:06,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:22:06,687 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:06,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:06,687 INFO L85 PathProgramCache]: Analyzing trace with hash 17506197, now seen corresponding path program 1 times [2025-01-09 08:22:06,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:06,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123005476] [2025-01-09 08:22:06,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:06,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:06,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 08:22:06,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 08:22:06,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:06,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:07,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123005476] [2025-01-09 08:22:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123005476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789837287] [2025-01-09 08:22:07,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:07,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:07,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:07,056 INFO L87 Difference]: Start difference. First operand 544 states and 811 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-01-09 08:22:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:07,120 INFO L93 Difference]: Finished difference Result 1050 states and 1566 transitions. [2025-01-09 08:22:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:22:07,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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 49 [2025-01-09 08:22:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:07,123 INFO L225 Difference]: With dead ends: 1050 [2025-01-09 08:22:07,123 INFO L226 Difference]: Without dead ends: 560 [2025-01-09 08:22:07,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:07,125 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 13 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:07,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3215 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:07,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-01-09 08:22:07,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 557. [2025-01-09 08:22:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 556 states have (on average 1.4910071942446044) internal successors, (829), 556 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 829 transitions. [2025-01-09 08:22:07,134 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 829 transitions. Word has length 49 [2025-01-09 08:22:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:07,136 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 829 transitions. [2025-01-09 08:22:07,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 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-01-09 08:22:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 829 transitions. [2025-01-09 08:22:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 08:22:07,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:07,140 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] [2025-01-09 08:22:07,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:22:07,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:07,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:07,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1296822327, now seen corresponding path program 1 times [2025-01-09 08:22:07,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:07,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644527497] [2025-01-09 08:22:07,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:07,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:07,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 08:22:07,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 08:22:07,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:07,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:07,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:07,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644527497] [2025-01-09 08:22:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644527497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:07,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:07,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196855325] [2025-01-09 08:22:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:07,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:07,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:07,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:07,409 INFO L87 Difference]: Start difference. First operand 557 states and 829 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:07,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:07,464 INFO L93 Difference]: Finished difference Result 1062 states and 1581 transitions. [2025-01-09 08:22:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:07,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2025-01-09 08:22:07,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:07,467 INFO L225 Difference]: With dead ends: 1062 [2025-01-09 08:22:07,468 INFO L226 Difference]: Without dead ends: 559 [2025-01-09 08:22:07,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:07,470 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 779 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:07,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 2396 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2025-01-09 08:22:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2025-01-09 08:22:07,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.489247311827957) internal successors, (831), 558 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 831 transitions. [2025-01-09 08:22:07,481 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 831 transitions. Word has length 50 [2025-01-09 08:22:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:07,481 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 831 transitions. [2025-01-09 08:22:07,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 831 transitions. [2025-01-09 08:22:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 08:22:07,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:07,482 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] [2025-01-09 08:22:07,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:22:07,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:07,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:07,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1451579181, now seen corresponding path program 1 times [2025-01-09 08:22:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169444689] [2025-01-09 08:22:07,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:07,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 08:22:07,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 08:22:07,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:07,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:07,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169444689] [2025-01-09 08:22:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169444689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:07,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:07,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320425970] [2025-01-09 08:22:07,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:07,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:07,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:07,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:07,792 INFO L87 Difference]: Start difference. First operand 559 states and 831 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:07,879 INFO L93 Difference]: Finished difference Result 1205 states and 1787 transitions. [2025-01-09 08:22:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:07,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 50 [2025-01-09 08:22:07,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:07,882 INFO L225 Difference]: With dead ends: 1205 [2025-01-09 08:22:07,882 INFO L226 Difference]: Without dead ends: 700 [2025-01-09 08:22:07,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:07,883 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 1137 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:07,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 2382 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:07,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-01-09 08:22:07,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 573. [2025-01-09 08:22:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 1.4842657342657342) internal successors, (849), 572 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 849 transitions. [2025-01-09 08:22:07,894 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 849 transitions. Word has length 50 [2025-01-09 08:22:07,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:07,894 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 849 transitions. [2025-01-09 08:22:07,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:07,894 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 849 transitions. [2025-01-09 08:22:07,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 08:22:07,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:07,895 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] [2025-01-09 08:22:07,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:22:07,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2033543712, now seen corresponding path program 1 times [2025-01-09 08:22:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128019368] [2025-01-09 08:22:07,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:07,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 08:22:07,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 08:22:07,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:08,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:08,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128019368] [2025-01-09 08:22:08,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128019368] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:08,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:08,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:22:08,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501522346] [2025-01-09 08:22:08,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:08,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:22:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:08,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:22:08,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:08,159 INFO L87 Difference]: Start difference. First operand 573 states and 849 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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-01-09 08:22:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:08,229 INFO L93 Difference]: Finished difference Result 1086 states and 1612 transitions. [2025-01-09 08:22:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:22:08,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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 51 [2025-01-09 08:22:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:08,231 INFO L225 Difference]: With dead ends: 1086 [2025-01-09 08:22:08,232 INFO L226 Difference]: Without dead ends: 581 [2025-01-09 08:22:08,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:08,233 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 12 mSDsluCounter, 3980 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4779 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:08,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4779 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-01-09 08:22:08,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 580. [2025-01-09 08:22:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.4835924006908463) internal successors, (859), 579 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:08,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 859 transitions. [2025-01-09 08:22:08,245 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 859 transitions. Word has length 51 [2025-01-09 08:22:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:08,245 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 859 transitions. [2025-01-09 08:22:08,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 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-01-09 08:22:08,246 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 859 transitions. [2025-01-09 08:22:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 08:22:08,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:08,246 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] [2025-01-09 08:22:08,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:22:08,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:08,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:08,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2035892791, now seen corresponding path program 1 times [2025-01-09 08:22:08,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:08,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923142666] [2025-01-09 08:22:08,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:08,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 08:22:08,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 08:22:08,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:08,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:08,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:08,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923142666] [2025-01-09 08:22:08,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923142666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:08,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:08,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:08,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093495188] [2025-01-09 08:22:08,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:08,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:08,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:08,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:08,523 INFO L87 Difference]: Start difference. First operand 580 states and 859 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:08,661 INFO L93 Difference]: Finished difference Result 1300 states and 1925 transitions. [2025-01-09 08:22:08,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:22:08,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 52 [2025-01-09 08:22:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:08,665 INFO L225 Difference]: With dead ends: 1300 [2025-01-09 08:22:08,665 INFO L226 Difference]: Without dead ends: 786 [2025-01-09 08:22:08,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:22:08,688 INFO L435 NwaCegarLoop]: 788 mSDtfsCounter, 1352 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 2364 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:08,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 2364 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-01-09 08:22:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 580. [2025-01-09 08:22:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.4818652849740932) internal successors, (858), 579 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 858 transitions. [2025-01-09 08:22:08,702 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 858 transitions. Word has length 52 [2025-01-09 08:22:08,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:08,703 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 858 transitions. [2025-01-09 08:22:08,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:08,703 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 858 transitions. [2025-01-09 08:22:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 08:22:08,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:08,704 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] [2025-01-09 08:22:08,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:22:08,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:08,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:08,705 INFO L85 PathProgramCache]: Analyzing trace with hash 524993220, now seen corresponding path program 1 times [2025-01-09 08:22:08,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:08,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760026288] [2025-01-09 08:22:08,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:08,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 08:22:08,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 08:22:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:09,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760026288] [2025-01-09 08:22:09,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760026288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:09,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:22:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207323544] [2025-01-09 08:22:09,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:22:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:09,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:22:09,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:22:09,055 INFO L87 Difference]: Start difference. First operand 580 states and 858 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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-01-09 08:22:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:09,316 INFO L93 Difference]: Finished difference Result 1236 states and 1830 transitions. [2025-01-09 08:22:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:22:09,317 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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 53 [2025-01-09 08:22:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:09,319 INFO L225 Difference]: With dead ends: 1236 [2025-01-09 08:22:09,319 INFO L226 Difference]: Without dead ends: 724 [2025-01-09 08:22:09,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:22:09,320 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 1144 mSDsluCounter, 4889 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:09,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 5679 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:22:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-01-09 08:22:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 592. [2025-01-09 08:22:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.478849407783418) internal successors, (874), 591 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 874 transitions. [2025-01-09 08:22:09,331 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 874 transitions. Word has length 53 [2025-01-09 08:22:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:09,331 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 874 transitions. [2025-01-09 08:22:09,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 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-01-09 08:22:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 874 transitions. [2025-01-09 08:22:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 08:22:09,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:09,333 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] [2025-01-09 08:22:09,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:22:09,333 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:09,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:09,334 INFO L85 PathProgramCache]: Analyzing trace with hash -520113366, now seen corresponding path program 1 times [2025-01-09 08:22:09,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:09,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620508505] [2025-01-09 08:22:09,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:09,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:09,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 08:22:09,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 08:22:09,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:09,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:09,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620508505] [2025-01-09 08:22:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620508505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577096864] [2025-01-09 08:22:09,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:09,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:09,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:09,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:09,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:09,621 INFO L87 Difference]: Start difference. First operand 592 states and 874 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-01-09 08:22:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:09,736 INFO L93 Difference]: Finished difference Result 1296 states and 1916 transitions. [2025-01-09 08:22:09,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:09,737 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 53 [2025-01-09 08:22:09,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:09,740 INFO L225 Difference]: With dead ends: 1296 [2025-01-09 08:22:09,740 INFO L226 Difference]: Without dead ends: 774 [2025-01-09 08:22:09,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:09,742 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 1344 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:09,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 2367 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2025-01-09 08:22:09,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 580. [2025-01-09 08:22:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.4835924006908463) internal successors, (859), 579 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 859 transitions. [2025-01-09 08:22:09,752 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 859 transitions. Word has length 53 [2025-01-09 08:22:09,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:09,752 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 859 transitions. [2025-01-09 08:22:09,753 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-01-09 08:22:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 859 transitions. [2025-01-09 08:22:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 08:22:09,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:09,753 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] [2025-01-09 08:22:09,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:22:09,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:09,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1718805400, now seen corresponding path program 1 times [2025-01-09 08:22:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:09,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513368922] [2025-01-09 08:22:09,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:09,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 08:22:09,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 08:22:09,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:09,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:10,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513368922] [2025-01-09 08:22:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513368922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:22:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003698648] [2025-01-09 08:22:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:22:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:10,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:22:10,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:22:10,016 INFO L87 Difference]: Start difference. First operand 580 states and 859 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:10,214 INFO L93 Difference]: Finished difference Result 1216 states and 1799 transitions. [2025-01-09 08:22:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:22:10,215 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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-01-09 08:22:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:10,217 INFO L225 Difference]: With dead ends: 1216 [2025-01-09 08:22:10,217 INFO L226 Difference]: Without dead ends: 704 [2025-01-09 08:22:10,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:22:10,218 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1144 mSDsluCounter, 4724 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 5513 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:10,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 5513 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:10,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-01-09 08:22:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 583. [2025-01-09 08:22:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 1.4828178694158076) internal successors, (863), 582 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 863 transitions. [2025-01-09 08:22:10,228 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 863 transitions. Word has length 54 [2025-01-09 08:22:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:10,228 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 863 transitions. [2025-01-09 08:22:10,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 863 transitions. [2025-01-09 08:22:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 08:22:10,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:10,229 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] [2025-01-09 08:22:10,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:22:10,229 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:10,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash 808913972, now seen corresponding path program 1 times [2025-01-09 08:22:10,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:10,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246721285] [2025-01-09 08:22:10,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:10,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:10,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 08:22:10,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 08:22:10,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:10,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:10,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:10,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246721285] [2025-01-09 08:22:10,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246721285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:10,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:10,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:22:10,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721632325] [2025-01-09 08:22:10,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:10,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:22:10,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:10,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:22:10,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:10,397 INFO L87 Difference]: Start difference. First operand 583 states and 863 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:10,542 INFO L93 Difference]: Finished difference Result 1216 states and 1799 transitions. [2025-01-09 08:22:10,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:22:10,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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-01-09 08:22:10,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:10,546 INFO L225 Difference]: With dead ends: 1216 [2025-01-09 08:22:10,546 INFO L226 Difference]: Without dead ends: 704 [2025-01-09 08:22:10,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:22:10,548 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 1124 mSDsluCounter, 3164 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 3957 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:10,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 3957 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:10,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2025-01-09 08:22:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 587. [2025-01-09 08:22:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 586 states have (on average 1.4812286689419796) internal successors, (868), 586 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 868 transitions. [2025-01-09 08:22:10,558 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 868 transitions. Word has length 54 [2025-01-09 08:22:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:10,558 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 868 transitions. [2025-01-09 08:22:10,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 868 transitions. [2025-01-09 08:22:10,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 08:22:10,559 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:10,559 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] [2025-01-09 08:22:10,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:22:10,559 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:10,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash -583519096, now seen corresponding path program 1 times [2025-01-09 08:22:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:10,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10264888] [2025-01-09 08:22:10,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:10,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 08:22:10,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 08:22:10,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:10,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:11,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:11,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10264888] [2025-01-09 08:22:11,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10264888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:11,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:11,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 08:22:11,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753474418] [2025-01-09 08:22:11,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:11,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 08:22:11,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:11,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 08:22:11,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:22:11,173 INFO L87 Difference]: Start difference. First operand 587 states and 868 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:11,438 INFO L93 Difference]: Finished difference Result 1113 states and 1649 transitions. [2025-01-09 08:22:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:22:11,438 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 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-01-09 08:22:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:11,440 INFO L225 Difference]: With dead ends: 1113 [2025-01-09 08:22:11,440 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 08:22:11,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-01-09 08:22:11,442 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 817 mSDsluCounter, 7823 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 8608 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:11,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 8608 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:22:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 08:22:11,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2025-01-09 08:22:11,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4807370184254607) internal successors, (884), 597 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:11,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 884 transitions. [2025-01-09 08:22:11,451 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 884 transitions. Word has length 55 [2025-01-09 08:22:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:11,452 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 884 transitions. [2025-01-09 08:22:11,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 884 transitions. [2025-01-09 08:22:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 08:22:11,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:11,452 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] [2025-01-09 08:22:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:22:11,453 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 655322582, now seen corresponding path program 1 times [2025-01-09 08:22:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:11,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316774300] [2025-01-09 08:22:11,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:11,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 08:22:11,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 08:22:11,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:11,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316774300] [2025-01-09 08:22:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316774300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:11,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:11,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942570147] [2025-01-09 08:22:11,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:11,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:11,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:11,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:11,691 INFO L87 Difference]: Start difference. First operand 598 states and 884 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-01-09 08:22:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:11,789 INFO L93 Difference]: Finished difference Result 1226 states and 1810 transitions. [2025-01-09 08:22:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:11,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-01-09 08:22:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:11,792 INFO L225 Difference]: With dead ends: 1226 [2025-01-09 08:22:11,792 INFO L226 Difference]: Without dead ends: 695 [2025-01-09 08:22:11,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:11,793 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 930 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 2365 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:11,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 2365 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:11,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-01-09 08:22:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 592. [2025-01-09 08:22:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 1.4805414551607445) internal successors, (875), 591 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 875 transitions. [2025-01-09 08:22:11,804 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 875 transitions. Word has length 56 [2025-01-09 08:22:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:11,804 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 875 transitions. [2025-01-09 08:22:11,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-01-09 08:22:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 875 transitions. [2025-01-09 08:22:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 08:22:11,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:11,805 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] [2025-01-09 08:22:11,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:22:11,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:11,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1277840950, now seen corresponding path program 1 times [2025-01-09 08:22:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:11,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145880902] [2025-01-09 08:22:11,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:11,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:11,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 08:22:11,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 08:22:11,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:11,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:12,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:12,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145880902] [2025-01-09 08:22:12,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145880902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:12,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:12,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 08:22:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002559434] [2025-01-09 08:22:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:12,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 08:22:12,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:12,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 08:22:12,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:22:12,253 INFO L87 Difference]: Start difference. First operand 592 states and 875 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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-01-09 08:22:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:12,524 INFO L93 Difference]: Finished difference Result 1230 states and 1817 transitions. [2025-01-09 08:22:12,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:22:12,525 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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-01-09 08:22:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:12,527 INFO L225 Difference]: With dead ends: 1230 [2025-01-09 08:22:12,527 INFO L226 Difference]: Without dead ends: 707 [2025-01-09 08:22:12,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2025-01-09 08:22:12,529 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1118 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 5511 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:12,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 5511 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:22:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2025-01-09 08:22:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 595. [2025-01-09 08:22:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.47979797979798) internal successors, (879), 594 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:12,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 879 transitions. [2025-01-09 08:22:12,542 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 879 transitions. Word has length 56 [2025-01-09 08:22:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:12,542 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 879 transitions. [2025-01-09 08:22:12,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 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-01-09 08:22:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 879 transitions. [2025-01-09 08:22:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 08:22:12,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:12,543 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] [2025-01-09 08:22:12,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:22:12,543 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:12,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2147127706, now seen corresponding path program 1 times [2025-01-09 08:22:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:12,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977681382] [2025-01-09 08:22:12,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:12,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 08:22:12,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 08:22:12,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:12,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:12,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977681382] [2025-01-09 08:22:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977681382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:12,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163401919] [2025-01-09 08:22:12,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:12,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:12,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:12,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:12,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:12,844 INFO L87 Difference]: Start difference. First operand 595 states and 879 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-01-09 08:22:12,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:12,947 INFO L93 Difference]: Finished difference Result 1201 states and 1776 transitions. [2025-01-09 08:22:12,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:12,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-01-09 08:22:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:12,949 INFO L225 Difference]: With dead ends: 1201 [2025-01-09 08:22:12,949 INFO L226 Difference]: Without dead ends: 674 [2025-01-09 08:22:12,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:12,950 INFO L435 NwaCegarLoop]: 791 mSDtfsCounter, 1034 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1034 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:12,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1034 Valid, 2367 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-01-09 08:22:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 591. [2025-01-09 08:22:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 1.4796610169491526) internal successors, (873), 590 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 873 transitions. [2025-01-09 08:22:12,961 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 873 transitions. Word has length 57 [2025-01-09 08:22:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:12,961 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 873 transitions. [2025-01-09 08:22:12,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 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-01-09 08:22:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 873 transitions. [2025-01-09 08:22:12,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 08:22:12,964 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:12,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:12,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 08:22:12,964 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:12,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1190288713, now seen corresponding path program 1 times [2025-01-09 08:22:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:12,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659368245] [2025-01-09 08:22:12,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:13,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 08:22:14,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 08:22:14,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:14,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:15,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:15,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659368245] [2025-01-09 08:22:15,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659368245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:15,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:15,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:15,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117265146] [2025-01-09 08:22:15,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:15,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:15,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:15,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:15,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:15,453 INFO L87 Difference]: Start difference. First operand 591 states and 873 transitions. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:15,582 INFO L93 Difference]: Finished difference Result 1753 states and 2601 transitions. [2025-01-09 08:22:15,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:22:15,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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 297 [2025-01-09 08:22:15,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:15,587 INFO L225 Difference]: With dead ends: 1753 [2025-01-09 08:22:15,587 INFO L226 Difference]: Without dead ends: 1230 [2025-01-09 08:22:15,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:22:15,589 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 683 mSDsluCounter, 3635 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 4585 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:15,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 4585 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2025-01-09 08:22:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1027. [2025-01-09 08:22:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 1026 states have (on average 1.4853801169590644) internal successors, (1524), 1026 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-01-09 08:22:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1524 transitions. [2025-01-09 08:22:15,610 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1524 transitions. Word has length 297 [2025-01-09 08:22:15,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:15,611 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1524 transitions. [2025-01-09 08:22:15,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:15,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1524 transitions. [2025-01-09 08:22:15,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-01-09 08:22:15,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:15,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:15,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 08:22:15,615 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:15,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash 833700704, now seen corresponding path program 1 times [2025-01-09 08:22:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:15,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734625893] [2025-01-09 08:22:15,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:15,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-01-09 08:22:16,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-01-09 08:22:16,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:16,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:17,941 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 08:22:17,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:17,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734625893] [2025-01-09 08:22:17,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734625893] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:17,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:17,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:22:17,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396034041] [2025-01-09 08:22:17,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:17,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:22:17,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:17,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:22:17,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:17,943 INFO L87 Difference]: Start difference. First operand 1027 states and 1524 transitions. Second operand has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:18,008 INFO L93 Difference]: Finished difference Result 1989 states and 2957 transitions. [2025-01-09 08:22:18,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:22:18,008 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 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 298 [2025-01-09 08:22:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:18,013 INFO L225 Difference]: With dead ends: 1989 [2025-01-09 08:22:18,013 INFO L226 Difference]: Without dead ends: 1030 [2025-01-09 08:22:18,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:18,015 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 13 mSDsluCounter, 3957 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4755 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:18,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4755 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:22:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-01-09 08:22:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2025-01-09 08:22:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4839650145772594) internal successors, (1527), 1029 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1527 transitions. [2025-01-09 08:22:18,034 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1527 transitions. Word has length 298 [2025-01-09 08:22:18,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:18,035 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1527 transitions. [2025-01-09 08:22:18,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.42857142857143) internal successors, (297), 7 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1527 transitions. [2025-01-09 08:22:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 08:22:18,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:18,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:18,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 08:22:18,039 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:18,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -711921651, now seen corresponding path program 1 times [2025-01-09 08:22:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:18,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937731186] [2025-01-09 08:22:18,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:18,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:18,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 08:22:18,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 08:22:18,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:18,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937731186] [2025-01-09 08:22:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937731186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:19,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 08:22:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639490670] [2025-01-09 08:22:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:19,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:22:19,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:19,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:22:19,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:22:19,644 INFO L87 Difference]: Start difference. First operand 1030 states and 1527 transitions. Second operand has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:19,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:19,785 INFO L93 Difference]: Finished difference Result 2193 states and 3252 transitions. [2025-01-09 08:22:19,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 08:22:19,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 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 299 [2025-01-09 08:22:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:19,790 INFO L225 Difference]: With dead ends: 2193 [2025-01-09 08:22:19,790 INFO L226 Difference]: Without dead ends: 1231 [2025-01-09 08:22:19,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 08:22:19,792 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 681 mSDsluCounter, 5551 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 6507 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:19,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 6507 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-01-09 08:22:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1042. [2025-01-09 08:22:19,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 1.4822286263208453) internal successors, (1543), 1041 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1543 transitions. [2025-01-09 08:22:19,812 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1543 transitions. Word has length 299 [2025-01-09 08:22:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:19,812 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1543 transitions. [2025-01-09 08:22:19,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1543 transitions. [2025-01-09 08:22:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 08:22:19,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:19,816 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:19,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 08:22:19,816 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:19,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 983805122, now seen corresponding path program 1 times [2025-01-09 08:22:19,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:19,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110519631] [2025-01-09 08:22:19,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:19,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:19,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 08:22:21,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 08:22:21,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:21,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 08:22:22,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110519631] [2025-01-09 08:22:22,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110519631] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:22:22,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084091376] [2025-01-09 08:22:22,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:22,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:22:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:22:22,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:22:22,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 08:22:23,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 08:22:23,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 08:22:23,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:23,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:23,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 2482 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 08:22:23,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:22:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:25,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:22:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 08:22:26,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084091376] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:22:26,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:22:26,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 14 [2025-01-09 08:22:26,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027994747] [2025-01-09 08:22:26,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:22:26,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 08:22:26,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:26,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 08:22:26,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-01-09 08:22:26,585 INFO L87 Difference]: Start difference. First operand 1042 states and 1543 transitions. Second operand has 14 states, 14 states have (on average 62.07142857142857) internal successors, (869), 14 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:27,287 INFO L93 Difference]: Finished difference Result 2025 states and 3001 transitions. [2025-01-09 08:22:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:22:27,287 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 62.07142857142857) internal successors, (869), 14 states have internal predecessors, (869), 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 299 [2025-01-09 08:22:27,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:27,291 INFO L225 Difference]: With dead ends: 2025 [2025-01-09 08:22:27,291 INFO L226 Difference]: Without dead ends: 1049 [2025-01-09 08:22:27,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:22:27,293 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 1248 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:27,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 2913 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 08:22:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-01-09 08:22:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1042. [2025-01-09 08:22:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 1.4822286263208453) internal successors, (1543), 1041 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1543 transitions. [2025-01-09 08:22:27,311 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1543 transitions. Word has length 299 [2025-01-09 08:22:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:27,311 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1543 transitions. [2025-01-09 08:22:27,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.07142857142857) internal successors, (869), 14 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:27,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1543 transitions. [2025-01-09 08:22:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-01-09 08:22:27,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:27,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:27,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:22:27,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:22:27,517 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:27,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash 2138420977, now seen corresponding path program 1 times [2025-01-09 08:22:27,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:27,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038682482] [2025-01-09 08:22:27,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:27,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:27,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-01-09 08:22:28,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-01-09 08:22:28,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:28,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:30,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038682482] [2025-01-09 08:22:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038682482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:30,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 08:22:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080692585] [2025-01-09 08:22:30,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:30,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 08:22:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:30,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 08:22:30,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:22:30,008 INFO L87 Difference]: Start difference. First operand 1042 states and 1543 transitions. Second operand has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:30,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:30,457 INFO L93 Difference]: Finished difference Result 2113 states and 3129 transitions. [2025-01-09 08:22:30,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:22:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 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 299 [2025-01-09 08:22:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:30,460 INFO L225 Difference]: With dead ends: 2113 [2025-01-09 08:22:30,460 INFO L226 Difference]: Without dead ends: 1137 [2025-01-09 08:22:30,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:22:30,462 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 1076 mSDsluCounter, 1835 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:30,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 2450 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:22:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-01-09 08:22:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1079. [2025-01-09 08:22:30,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.476808905380334) internal successors, (1592), 1078 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1592 transitions. [2025-01-09 08:22:30,479 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1592 transitions. Word has length 299 [2025-01-09 08:22:30,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:30,479 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1592 transitions. [2025-01-09 08:22:30,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1592 transitions. [2025-01-09 08:22:30,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-09 08:22:30,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:30,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:30,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 08:22:30,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:30,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1422109070, now seen corresponding path program 1 times [2025-01-09 08:22:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:30,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307507425] [2025-01-09 08:22:30,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:30,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 08:22:32,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 08:22:32,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:32,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:33,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:33,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307507425] [2025-01-09 08:22:33,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307507425] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:33,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:33,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:22:33,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333974306] [2025-01-09 08:22:33,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:33,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:22:33,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:33,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:22:33,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:33,197 INFO L87 Difference]: Start difference. First operand 1079 states and 1592 transitions. Second operand has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:33,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:33,347 INFO L93 Difference]: Finished difference Result 3590 states and 5331 transitions. [2025-01-09 08:22:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:22:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 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 300 [2025-01-09 08:22:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:33,354 INFO L225 Difference]: With dead ends: 3590 [2025-01-09 08:22:33,354 INFO L226 Difference]: Without dead ends: 2614 [2025-01-09 08:22:33,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 08:22:33,356 INFO L435 NwaCegarLoop]: 1050 mSDtfsCounter, 960 mSDsluCounter, 3926 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 4976 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:33,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 4976 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2025-01-09 08:22:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 1977. [2025-01-09 08:22:33,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.486842105263158) internal successors, (2938), 1976 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2938 transitions. [2025-01-09 08:22:33,384 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2938 transitions. Word has length 300 [2025-01-09 08:22:33,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:33,385 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2938 transitions. [2025-01-09 08:22:33,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 42.857142857142854) internal successors, (300), 7 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2938 transitions. [2025-01-09 08:22:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 08:22:33,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:33,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:33,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 08:22:33,388 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:33,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash 43687887, now seen corresponding path program 1 times [2025-01-09 08:22:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:33,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120848420] [2025-01-09 08:22:33,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:33,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 08:22:35,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 08:22:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:35,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:37,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:37,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120848420] [2025-01-09 08:22:37,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120848420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:37,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:37,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921868668] [2025-01-09 08:22:37,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:37,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:37,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:37,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:37,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:37,013 INFO L87 Difference]: Start difference. First operand 1977 states and 2938 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:37,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:37,200 INFO L93 Difference]: Finished difference Result 3959 states and 5896 transitions. [2025-01-09 08:22:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:22:37,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 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 301 [2025-01-09 08:22:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:37,208 INFO L225 Difference]: With dead ends: 3959 [2025-01-09 08:22:37,208 INFO L226 Difference]: Without dead ends: 2085 [2025-01-09 08:22:37,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:22:37,211 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1275 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:37,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 2244 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-01-09 08:22:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1955. [2025-01-09 08:22:37,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1954 states have (on average 1.4866939611054248) internal successors, (2905), 1954 states have internal predecessors, (2905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2905 transitions. [2025-01-09 08:22:37,233 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2905 transitions. Word has length 301 [2025-01-09 08:22:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:37,234 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 2905 transitions. [2025-01-09 08:22:37,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2905 transitions. [2025-01-09 08:22:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-01-09 08:22:37,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:37,236 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:37,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 08:22:37,237 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:37,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1624277377, now seen corresponding path program 1 times [2025-01-09 08:22:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559455197] [2025-01-09 08:22:37,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:37,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-01-09 08:22:38,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-01-09 08:22:38,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:38,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:40,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:40,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559455197] [2025-01-09 08:22:40,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559455197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:40,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:40,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:22:40,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069578679] [2025-01-09 08:22:40,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:40,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:22:40,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:40,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:22:40,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:22:40,177 INFO L87 Difference]: Start difference. First operand 1955 states and 2905 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:40,361 INFO L93 Difference]: Finished difference Result 3959 states and 5895 transitions. [2025-01-09 08:22:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:22:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 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 301 [2025-01-09 08:22:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:40,366 INFO L225 Difference]: With dead ends: 3959 [2025-01-09 08:22:40,366 INFO L226 Difference]: Without dead ends: 2085 [2025-01-09 08:22:40,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:22:40,368 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 1271 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:40,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 2244 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:40,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-01-09 08:22:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1955. [2025-01-09 08:22:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1955 states, 1954 states have (on average 1.4861821903787102) internal successors, (2904), 1954 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2904 transitions. [2025-01-09 08:22:40,387 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2904 transitions. Word has length 301 [2025-01-09 08:22:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:40,388 INFO L471 AbstractCegarLoop]: Abstraction has 1955 states and 2904 transitions. [2025-01-09 08:22:40,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2904 transitions. [2025-01-09 08:22:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-01-09 08:22:40,389 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:40,389 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:40,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 08:22:40,390 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:40,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1620686155, now seen corresponding path program 1 times [2025-01-09 08:22:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:40,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780132569] [2025-01-09 08:22:40,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:40,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 08:22:42,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 08:22:42,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:42,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:45,488 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:45,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:45,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780132569] [2025-01-09 08:22:45,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780132569] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:22:45,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144723987] [2025-01-09 08:22:45,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:22:45,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:22:45,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:22:45,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 08:22:46,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-01-09 08:22:46,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-01-09 08:22:46,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:46,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:46,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 2487 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 08:22:46,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:22:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:47,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:22:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:48,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144723987] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:22:48,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:22:48,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 8] total 26 [2025-01-09 08:22:48,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821631909] [2025-01-09 08:22:48,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:22:48,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 08:22:48,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:48,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 08:22:48,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2025-01-09 08:22:48,725 INFO L87 Difference]: Start difference. First operand 1955 states and 2904 transitions. Second operand has 26 states, 26 states have (on average 34.38461538461539) internal successors, (894), 26 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:52,345 INFO L93 Difference]: Finished difference Result 8405 states and 12510 transitions. [2025-01-09 08:22:52,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-01-09 08:22:52,347 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 34.38461538461539) internal successors, (894), 26 states have internal predecessors, (894), 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 302 [2025-01-09 08:22:52,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:52,362 INFO L225 Difference]: With dead ends: 8405 [2025-01-09 08:22:52,362 INFO L226 Difference]: Without dead ends: 6553 [2025-01-09 08:22:52,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2614 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1083, Invalid=8619, Unknown=0, NotChecked=0, Total=9702 [2025-01-09 08:22:52,369 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 14140 mSDsluCounter, 10207 mSDsCounter, 0 mSdLazyCounter, 4238 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14140 SdHoareTripleChecker+Valid, 10791 SdHoareTripleChecker+Invalid, 4256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:52,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14140 Valid, 10791 Invalid, 4256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4238 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 08:22:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6553 states. [2025-01-09 08:22:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6553 to 4503. [2025-01-09 08:22:52,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 4502 states have (on average 1.4917814304753443) internal successors, (6716), 4502 states have internal predecessors, (6716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 6716 transitions. [2025-01-09 08:22:52,436 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 6716 transitions. Word has length 302 [2025-01-09 08:22:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:52,436 INFO L471 AbstractCegarLoop]: Abstraction has 4503 states and 6716 transitions. [2025-01-09 08:22:52,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 34.38461538461539) internal successors, (894), 26 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 6716 transitions. [2025-01-09 08:22:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-01-09 08:22:52,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:52,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:52,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:22:52,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:22:52,639 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:52,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:52,639 INFO L85 PathProgramCache]: Analyzing trace with hash 725369034, now seen corresponding path program 1 times [2025-01-09 08:22:52,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:52,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928757090] [2025-01-09 08:22:52,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:52,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:52,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 08:22:54,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 08:22:54,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:22:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:22:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:22:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928757090] [2025-01-09 08:22:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928757090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:22:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:22:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 08:22:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83838681] [2025-01-09 08:22:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:22:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 08:22:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:22:55,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 08:22:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:22:55,624 INFO L87 Difference]: Start difference. First operand 4503 states and 6716 transitions. Second operand has 11 states, 11 states have (on average 27.636363636363637) internal successors, (304), 11 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:55,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:22:55,835 INFO L93 Difference]: Finished difference Result 8549 states and 12756 transitions. [2025-01-09 08:22:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 08:22:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 27.636363636363637) internal successors, (304), 11 states have internal predecessors, (304), 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 304 [2025-01-09 08:22:55,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:22:55,844 INFO L225 Difference]: With dead ends: 8549 [2025-01-09 08:22:55,844 INFO L226 Difference]: Without dead ends: 5014 [2025-01-09 08:22:55,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-01-09 08:22:55,848 INFO L435 NwaCegarLoop]: 938 mSDtfsCounter, 681 mSDsluCounter, 8177 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 9115 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:22:55,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 9115 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:22:55,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5014 states. [2025-01-09 08:22:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5014 to 4509. [2025-01-09 08:22:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 4508 states have (on average 1.491348713398403) internal successors, (6723), 4508 states have internal predecessors, (6723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 6723 transitions. [2025-01-09 08:22:55,888 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 6723 transitions. Word has length 304 [2025-01-09 08:22:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:22:55,888 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 6723 transitions. [2025-01-09 08:22:55,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.636363636363637) internal successors, (304), 11 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:22:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 6723 transitions. [2025-01-09 08:22:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2025-01-09 08:22:55,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:22:55,891 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:22:55,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 08:22:55,891 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:22:55,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:22:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash 786686009, now seen corresponding path program 1 times [2025-01-09 08:22:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:22:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100136168] [2025-01-09 08:22:55,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:22:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:22:55,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 08:22:58,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 08:22:58,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:22:58,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:23:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:23:00,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:23:00,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100136168] [2025-01-09 08:23:00,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100136168] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:23:00,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151594733] [2025-01-09 08:23:00,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:23:00,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:23:00,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:23:00,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:23:00,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 08:23:00,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 304 statements into 1 equivalence classes. [2025-01-09 08:23:01,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 304 of 304 statements. [2025-01-09 08:23:01,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:23:01,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:23:01,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 2489 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-01-09 08:23:01,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:23:01,706 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:23:01,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:23:01,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151594733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:23:01,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:23:01,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2025-01-09 08:23:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816970096] [2025-01-09 08:23:01,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:23:01,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 08:23:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:23:01,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 08:23:01,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2025-01-09 08:23:01,707 INFO L87 Difference]: Start difference. First operand 4509 states and 6723 transitions. Second operand has 9 states, 9 states have (on average 33.77777777777778) internal successors, (304), 9 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:23:02,179 INFO L93 Difference]: Finished difference Result 9670 states and 14409 transitions. [2025-01-09 08:23:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:23:02,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.77777777777778) internal successors, (304), 9 states have internal predecessors, (304), 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 304 [2025-01-09 08:23:02,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:23:02,188 INFO L225 Difference]: With dead ends: 9670 [2025-01-09 08:23:02,188 INFO L226 Difference]: Without dead ends: 5249 [2025-01-09 08:23:02,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2025-01-09 08:23:02,193 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 1253 mSDsluCounter, 3076 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 3695 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 08:23:02,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 3695 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 08:23:02,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5249 states. [2025-01-09 08:23:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5249 to 4626. [2025-01-09 08:23:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4626 states, 4625 states have (on average 1.4854054054054053) internal successors, (6870), 4625 states have internal predecessors, (6870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 6870 transitions. [2025-01-09 08:23:02,234 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 6870 transitions. Word has length 304 [2025-01-09 08:23:02,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:23:02,234 INFO L471 AbstractCegarLoop]: Abstraction has 4626 states and 6870 transitions. [2025-01-09 08:23:02,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.77777777777778) internal successors, (304), 9 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 6870 transitions. [2025-01-09 08:23:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 08:23:02,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:23:02,241 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:23:02,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 08:23:02,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:23:02,442 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:23:02,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:23:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1405315388, now seen corresponding path program 1 times [2025-01-09 08:23:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:23:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493494935] [2025-01-09 08:23:02,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:23:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:23:02,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 08:23:04,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 08:23:04,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:23:04,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:23:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:23:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:23:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493494935] [2025-01-09 08:23:05,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493494935] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:23:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350763318] [2025-01-09 08:23:05,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:23:05,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:23:05,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:23:05,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:23:05,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 08:23:06,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 08:23:07,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 08:23:07,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:23:07,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:23:07,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 2492 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 08:23:07,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:23:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:23:07,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:23:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350763318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:23:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:23:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-01-09 08:23:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764559930] [2025-01-09 08:23:07,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:23:07,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:23:07,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:23:07,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:23:07,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-01-09 08:23:07,344 INFO L87 Difference]: Start difference. First operand 4626 states and 6870 transitions. Second operand has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:23:07,873 INFO L93 Difference]: Finished difference Result 9754 states and 14511 transitions. [2025-01-09 08:23:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:23:07,874 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 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 305 [2025-01-09 08:23:07,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:23:07,881 INFO L225 Difference]: With dead ends: 9754 [2025-01-09 08:23:07,882 INFO L226 Difference]: Without dead ends: 5234 [2025-01-09 08:23:07,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-01-09 08:23:07,886 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 950 mSDsluCounter, 3414 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 4119 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:23:07,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 4119 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 08:23:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2025-01-09 08:23:07,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 4626. [2025-01-09 08:23:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4626 states, 4625 states have (on average 1.484108108108108) internal successors, (6864), 4625 states have internal predecessors, (6864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 6864 transitions. [2025-01-09 08:23:07,930 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 6864 transitions. Word has length 305 [2025-01-09 08:23:07,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:23:07,930 INFO L471 AbstractCegarLoop]: Abstraction has 4626 states and 6864 transitions. [2025-01-09 08:23:07,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 38.125) internal successors, (305), 8 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 6864 transitions. [2025-01-09 08:23:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-01-09 08:23:07,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:23:07,933 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:23:07,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 08:23:08,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 08:23:08,134 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:23:08,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:23:08,134 INFO L85 PathProgramCache]: Analyzing trace with hash 459832542, now seen corresponding path program 1 times [2025-01-09 08:23:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:23:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105653374] [2025-01-09 08:23:08,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:23:08,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:23:08,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-01-09 08:23:09,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-01-09 08:23:09,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:23:09,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:23:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 08:23:10,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:23:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105653374] [2025-01-09 08:23:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105653374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:23:10,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:23:10,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:23:10,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894693861] [2025-01-09 08:23:10,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:23:10,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:23:10,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:23:10,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:23:10,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:23:10,340 INFO L87 Difference]: Start difference. First operand 4626 states and 6864 transitions. Second operand has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:23:10,467 INFO L93 Difference]: Finished difference Result 9165 states and 13613 transitions. [2025-01-09 08:23:10,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:23:10,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 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 305 [2025-01-09 08:23:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:23:10,474 INFO L225 Difference]: With dead ends: 9165 [2025-01-09 08:23:10,474 INFO L226 Difference]: Without dead ends: 4626 [2025-01-09 08:23:10,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:23:10,479 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 223 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:23:10,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 2966 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:23:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4626 states. [2025-01-09 08:23:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4626 to 4626. [2025-01-09 08:23:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4626 states, 4625 states have (on average 1.483891891891892) internal successors, (6863), 4625 states have internal predecessors, (6863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 6863 transitions. [2025-01-09 08:23:10,522 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 6863 transitions. Word has length 305 [2025-01-09 08:23:10,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:23:10,522 INFO L471 AbstractCegarLoop]: Abstraction has 4626 states and 6863 transitions. [2025-01-09 08:23:10,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:23:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 6863 transitions. [2025-01-09 08:23:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-09 08:23:10,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:23:10,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 08:23:10,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 08:23:10,524 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:23:10,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:23:10,525 INFO L85 PathProgramCache]: Analyzing trace with hash 525455346, now seen corresponding path program 1 times [2025-01-09 08:23:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:23:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151828716] [2025-01-09 08:23:10,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:23:10,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:23:10,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 08:23:12,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 08:23:12,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:23:12,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:23:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:23:15,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:23:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151828716] [2025-01-09 08:23:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151828716] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:23:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984646794] [2025-01-09 08:23:15,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:23:15,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:23:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:23:15,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:23:15,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 08:23:16,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 08:23:16,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 08:23:16,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:23:16,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:23:16,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 2495 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-01-09 08:23:16,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:23:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:23:17,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:23:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:23:18,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984646794] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:23:18,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:23:18,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 25, 19] total 51 [2025-01-09 08:23:18,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71334586] [2025-01-09 08:23:18,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:23:18,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 08:23:18,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:23:18,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 08:23:18,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2193, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 08:23:18,967 INFO L87 Difference]: Start difference. First operand 4626 states and 6863 transitions. Second operand has 51 states, 51 states have (on average 17.686274509803923) internal successors, (902), 51 states have internal predecessors, (902), 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)