./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.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_QF_BV_vlunc.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 f9c847a826e86c06ca90730b1e3bd09118dbfcc8c7c9aa6dc001687e12e32563 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:19:10,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:19:10,616 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:19:10,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:19:10,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:19:10,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:19:10,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:19:10,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:19:10,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:19:10,650 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:19:10,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:19:10,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:19:10,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:19:10,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:19:10,652 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:19:10,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:19:10,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:19:10,653 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:19:10,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:19:10,653 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:19:10,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:19:10,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:19:10,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:19:10,653 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:19:10,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:19:10,654 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:19:10,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:10,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:10,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:10,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:10,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:19:10,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:19:10,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:19:10,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:19:10,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:10,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:19:10,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:19:10,655 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:19:10,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:19:10,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:19:10,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:19:10,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:19:10,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:19:10,656 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:19:10,656 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:19:10,657 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 -> f9c847a826e86c06ca90730b1e3bd09118dbfcc8c7c9aa6dc001687e12e32563 [2025-01-09 08:19:10,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:19:10,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:19:10,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:19:10,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:19:10,943 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:19:10,945 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_QF_BV_vlunc.c [2025-01-09 08:19:12,186 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e166509e/6ccf4d07f0a94a90b8f3a980bfc4b8e5/FLAG4cd9a9365 [2025-01-09 08:19:12,527 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:19:12,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c [2025-01-09 08:19:12,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e166509e/6ccf4d07f0a94a90b8f3a980bfc4b8e5/FLAG4cd9a9365 [2025-01-09 08:19:12,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3e166509e/6ccf4d07f0a94a90b8f3a980bfc4b8e5 [2025-01-09 08:19:12,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:19:12,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:19:12,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:12,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:19:12,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:19:12,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:12,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4294bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12, skipping insertion in model container [2025-01-09 08:19:12,574 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:12,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:19:12,734 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_QF_BV_vlunc.c[1255,1268] [2025-01-09 08:19:12,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:12,833 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:19:12,841 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_QF_BV_vlunc.c[1255,1268] [2025-01-09 08:19:12,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:19:12,903 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:19:12,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12 WrapperNode [2025-01-09 08:19:12,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:19:12,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:12,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:19:12,904 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:19:12,909 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:19:12" (1/1) ... [2025-01-09 08:19:12,920 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:19:12" (1/1) ... [2025-01-09 08:19:12,987 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 516 [2025-01-09 08:19:12,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:19:12,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:19:12,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:19:12,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:19:12,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:12,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,048 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:19:13,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,088 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:19:13,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:19:13,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:19:13,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:19:13,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (1/1) ... [2025-01-09 08:19:13,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:19:13,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:13,131 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:19:13,135 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:19:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:19:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:19:13,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:19:13,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:19:13,273 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:19:13,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:19:14,082 INFO L? ?]: Removed 314 outVars from TransFormulas that were not future-live. [2025-01-09 08:19:14,083 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:19:14,094 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:19:14,094 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:19:14,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:14 BoogieIcfgContainer [2025-01-09 08:19:14,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:19:14,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:19:14,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:19:14,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:19:14,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:19:12" (1/3) ... [2025-01-09 08:19:14,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58185f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:19:14, skipping insertion in model container [2025-01-09 08:19:14,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:19:12" (2/3) ... [2025-01-09 08:19:14,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58185f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:19:14, skipping insertion in model container [2025-01-09 08:19:14,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:19:14" (3/3) ... [2025-01-09 08:19:14,103 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_QF_BV_vlunc.c [2025-01-09 08:19:14,115 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:19:14,116 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_QF_BV_vlunc.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:19:14,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:19:14,176 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;@43b404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:19:14,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:19:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 0 states have call successors, (0), 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:19:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 08:19:14,188 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:14,188 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] [2025-01-09 08:19:14,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:14,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:14,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1161288925, now seen corresponding path program 1 times [2025-01-09 08:19:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:14,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591053564] [2025-01-09 08:19:14,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:14,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:14,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 08:19:14,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 08:19:14,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:14,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:14,844 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:19:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591053564] [2025-01-09 08:19:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591053564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:14,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:19:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427979428] [2025-01-09 08:19:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:14,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:19:14,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:14,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:19:14,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:14,871 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 0 states have call successors, (0), 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.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:19:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:14,925 INFO L93 Difference]: Finished difference Result 233 states and 345 transitions. [2025-01-09 08:19:14,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:19:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-01-09 08:19:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:14,938 INFO L225 Difference]: With dead ends: 233 [2025-01-09 08:19:14,938 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 08:19:14,944 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:19:14,947 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 549 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:19:14,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 549 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 08:19:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-01-09 08:19:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4765625) internal successors, (189), 128 states have internal predecessors, (189), 0 states have call successors, (0), 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:19:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2025-01-09 08:19:14,981 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 45 [2025-01-09 08:19:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:14,982 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2025-01-09 08:19:14,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:19:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2025-01-09 08:19:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 08:19:14,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:14,983 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] [2025-01-09 08:19:14,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 08:19:14,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:14,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1638522894, now seen corresponding path program 1 times [2025-01-09 08:19:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:14,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244629644] [2025-01-09 08:19:14,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:15,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 08:19:15,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 08:19:15,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:15,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:15,197 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:19:15,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:15,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244629644] [2025-01-09 08:19:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244629644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:15,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:15,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:19:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115652892] [2025-01-09 08:19:15,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:15,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:19:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:15,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:19:15,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:19:15,201 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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:19:15,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:15,244 INFO L93 Difference]: Finished difference Result 234 states and 343 transitions. [2025-01-09 08:19:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:19:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2025-01-09 08:19:15,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:15,248 INFO L225 Difference]: With dead ends: 234 [2025-01-09 08:19:15,248 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 08:19:15,248 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:19:15,249 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 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:19:15,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 08:19:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-01-09 08:19:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 130 states have internal predecessors, (191), 0 states have call successors, (0), 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:19:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 191 transitions. [2025-01-09 08:19:15,264 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 191 transitions. Word has length 46 [2025-01-09 08:19:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:15,264 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 191 transitions. [2025-01-09 08:19:15,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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:19:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 191 transitions. [2025-01-09 08:19:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 08:19:15,266 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:15,266 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:19:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:19:15,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:15,268 INFO L85 PathProgramCache]: Analyzing trace with hash -352567844, now seen corresponding path program 1 times [2025-01-09 08:19:15,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:15,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840832667] [2025-01-09 08:19:15,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:15,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 08:19:15,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 08:19:15,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:15,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:15,721 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:19:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840832667] [2025-01-09 08:19:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840832667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:15,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:15,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:15,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360425999] [2025-01-09 08:19:15,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:15,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:15,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:15,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:15,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:15,725 INFO L87 Difference]: Start difference. First operand 131 states and 191 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:19:15,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:15,802 INFO L93 Difference]: Finished difference Result 241 states and 352 transitions. [2025-01-09 08:19:15,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 08:19:15,803 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:19:15,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:15,804 INFO L225 Difference]: With dead ends: 241 [2025-01-09 08:19:15,804 INFO L226 Difference]: Without dead ends: 136 [2025-01-09 08:19:15,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:15,807 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:15,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 889 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:15,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-01-09 08:19:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-01-09 08:19:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.4592592592592593) internal successors, (197), 135 states have internal predecessors, (197), 0 states have call successors, (0), 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:19:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2025-01-09 08:19:15,819 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 47 [2025-01-09 08:19:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:15,819 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2025-01-09 08:19:15,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 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:19:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2025-01-09 08:19:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 08:19:15,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:15,821 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:19:15,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:19:15,821 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:15,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1430781511, now seen corresponding path program 1 times [2025-01-09 08:19:15,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:15,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446817642] [2025-01-09 08:19:15,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:15,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 08:19:15,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 08:19:15,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:15,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:16,095 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:19:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446817642] [2025-01-09 08:19:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446817642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281652107] [2025-01-09 08:19:16,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:16,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:16,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:16,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:16,098 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 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:19:16,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:16,175 INFO L93 Difference]: Finished difference Result 257 states and 373 transitions. [2025-01-09 08:19:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:16,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 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:19:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:16,177 INFO L225 Difference]: With dead ends: 257 [2025-01-09 08:19:16,177 INFO L226 Difference]: Without dead ends: 147 [2025-01-09 08:19:16,177 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:19:16,178 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:16,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1063 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-01-09 08:19:16,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-01-09 08:19:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4452054794520548) internal successors, (211), 146 states have internal predecessors, (211), 0 states have call successors, (0), 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:19:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 211 transitions. [2025-01-09 08:19:16,193 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 211 transitions. Word has length 48 [2025-01-09 08:19:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:16,193 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 211 transitions. [2025-01-09 08:19:16,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 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:19:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 211 transitions. [2025-01-09 08:19:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 08:19:16,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:16,195 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:19:16,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:19:16,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:16,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1285611392, now seen corresponding path program 1 times [2025-01-09 08:19:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:16,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732511790] [2025-01-09 08:19:16,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:16,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 08:19:16,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 08:19:16,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:16,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:16,372 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:19:16,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732511790] [2025-01-09 08:19:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732511790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:16,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:16,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:16,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638444308] [2025-01-09 08:19:16,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:16,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:16,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:16,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:16,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:16,374 INFO L87 Difference]: Start difference. First operand 147 states and 211 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:19:16,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:16,462 INFO L93 Difference]: Finished difference Result 363 states and 519 transitions. [2025-01-09 08:19:16,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:16,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:19:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:16,464 INFO L225 Difference]: With dead ends: 363 [2025-01-09 08:19:16,464 INFO L226 Difference]: Without dead ends: 242 [2025-01-09 08:19:16,465 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:19:16,465 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 391 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:16,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:19:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-01-09 08:19:16,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 194. [2025-01-09 08:19:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 193 states have internal predecessors, (279), 0 states have call successors, (0), 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:19:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2025-01-09 08:19:16,485 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 48 [2025-01-09 08:19:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:16,485 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2025-01-09 08:19:16,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:19:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2025-01-09 08:19:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 08:19:16,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:16,487 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:19:16,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:19:16,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:16,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:16,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1420291833, now seen corresponding path program 1 times [2025-01-09 08:19:16,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:16,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563992588] [2025-01-09 08:19:16,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:16,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:16,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 08:19:16,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 08:19:16,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:16,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:16,671 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:19:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:16,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563992588] [2025-01-09 08:19:16,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563992588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:16,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:16,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:16,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926747953] [2025-01-09 08:19:16,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:16,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:16,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:16,677 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:16,749 INFO L93 Difference]: Finished difference Result 357 states and 507 transitions. [2025-01-09 08:19:16,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-01-09 08:19:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:16,751 INFO L225 Difference]: With dead ends: 357 [2025-01-09 08:19:16,751 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 08:19:16,752 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:19:16,753 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 359 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:16,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 08:19:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 188. [2025-01-09 08:19:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.4385026737967914) internal successors, (269), 187 states have internal predecessors, (269), 0 states have call successors, (0), 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:19:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 269 transitions. [2025-01-09 08:19:16,765 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 269 transitions. Word has length 49 [2025-01-09 08:19:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:16,765 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 269 transitions. [2025-01-09 08:19:16,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:16,766 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 269 transitions. [2025-01-09 08:19:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 08:19:16,766 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:16,767 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:19:16,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 08:19:16,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:16,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash -559412370, now seen corresponding path program 1 times [2025-01-09 08:19:16,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:16,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836517068] [2025-01-09 08:19:16,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:16,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:16,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 08:19:16,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 08:19:16,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:16,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:16,930 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:19:16,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:16,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836517068] [2025-01-09 08:19:16,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836517068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:16,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:16,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:16,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569069824] [2025-01-09 08:19:16,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:16,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:16,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:16,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:16,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:16,933 INFO L87 Difference]: Start difference. First operand 188 states and 269 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:19:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:16,990 INFO L93 Difference]: Finished difference Result 337 states and 480 transitions. [2025-01-09 08:19:16,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:16,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:19:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:16,991 INFO L225 Difference]: With dead ends: 337 [2025-01-09 08:19:16,992 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 08:19:16,992 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:19:16,993 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:16,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1063 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 08:19:16,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-01-09 08:19:16,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.4195121951219511) internal successors, (291), 205 states have internal predecessors, (291), 0 states have call successors, (0), 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:19:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 291 transitions. [2025-01-09 08:19:16,999 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 291 transitions. Word has length 49 [2025-01-09 08:19:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:16,999 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 291 transitions. [2025-01-09 08:19:16,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 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:19:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 291 transitions. [2025-01-09 08:19:17,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 08:19:17,000 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:17,000 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:19:17,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 08:19:17,001 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:17,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1444590169, now seen corresponding path program 1 times [2025-01-09 08:19:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:17,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617354360] [2025-01-09 08:19:17,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:17,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 08:19:17,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 08:19:17,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:17,173 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:19:17,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:17,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617354360] [2025-01-09 08:19:17,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617354360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:17,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:17,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:17,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313469384] [2025-01-09 08:19:17,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:17,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:17,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:17,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:17,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:17,177 INFO L87 Difference]: Start difference. First operand 206 states and 291 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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:19:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:17,237 INFO L93 Difference]: Finished difference Result 385 states and 543 transitions. [2025-01-09 08:19:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:17,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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:19:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:17,240 INFO L225 Difference]: With dead ends: 385 [2025-01-09 08:19:17,242 INFO L226 Difference]: Without dead ends: 228 [2025-01-09 08:19:17,242 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:19:17,243 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:17,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1063 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-01-09 08:19:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-01-09 08:19:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.4052863436123348) internal successors, (319), 227 states have internal predecessors, (319), 0 states have call successors, (0), 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:19:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 319 transitions. [2025-01-09 08:19:17,252 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 319 transitions. Word has length 50 [2025-01-09 08:19:17,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:17,252 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 319 transitions. [2025-01-09 08:19:17,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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:19:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 319 transitions. [2025-01-09 08:19:17,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 08:19:17,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:17,256 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:19:17,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 08:19:17,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:17,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash -662315090, now seen corresponding path program 1 times [2025-01-09 08:19:17,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:17,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59077896] [2025-01-09 08:19:17,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:17,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 08:19:17,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 08:19:17,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:17,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:17,386 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:19:17,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:17,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59077896] [2025-01-09 08:19:17,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59077896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:17,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:17,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896308001] [2025-01-09 08:19:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:17,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:17,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:17,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:17,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:17,390 INFO L87 Difference]: Start difference. First operand 228 states and 319 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:19:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:17,454 INFO L93 Difference]: Finished difference Result 428 states and 595 transitions. [2025-01-09 08:19:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:17,455 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:19:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:17,456 INFO L225 Difference]: With dead ends: 428 [2025-01-09 08:19:17,457 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 08:19:17,458 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:19:17,458 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 375 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:17,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 08:19:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 218. [2025-01-09 08:19:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 1.3963133640552996) internal successors, (303), 217 states have internal predecessors, (303), 0 states have call successors, (0), 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:19:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 303 transitions. [2025-01-09 08:19:17,467 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 303 transitions. Word has length 50 [2025-01-09 08:19:17,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:17,467 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 303 transitions. [2025-01-09 08:19:17,468 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:19:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 303 transitions. [2025-01-09 08:19:17,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 08:19:17,468 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:17,468 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:19:17,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 08:19:17,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:17,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash -75276800, now seen corresponding path program 1 times [2025-01-09 08:19:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:17,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10232989] [2025-01-09 08:19:17,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:17,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:17,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 08:19:17,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 08:19:17,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:17,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:17,636 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:19:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:17,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10232989] [2025-01-09 08:19:17,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10232989] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:17,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:17,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 08:19:17,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012817423] [2025-01-09 08:19:17,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:17,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:19:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:17,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:19:17,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:19:17,638 INFO L87 Difference]: Start difference. First operand 218 states and 303 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:19:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:17,692 INFO L93 Difference]: Finished difference Result 417 states and 579 transitions. [2025-01-09 08:19:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:19:17,693 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:19:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:17,694 INFO L225 Difference]: With dead ends: 417 [2025-01-09 08:19:17,694 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 08:19:17,694 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:19:17,695 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 5 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:17,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1063 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 08:19:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-01-09 08:19:17,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 1.3849372384937237) internal successors, (331), 239 states have internal predecessors, (331), 0 states have call successors, (0), 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:19:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 331 transitions. [2025-01-09 08:19:17,702 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 331 transitions. Word has length 51 [2025-01-09 08:19:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:17,702 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 331 transitions. [2025-01-09 08:19:17,702 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:19:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 331 transitions. [2025-01-09 08:19:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 08:19:17,702 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:17,705 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:19:17,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 08:19:17,705 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:17,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 543160409, now seen corresponding path program 1 times [2025-01-09 08:19:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:17,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933531452] [2025-01-09 08:19:17,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:17,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 08:19:17,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 08:19:17,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:17,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:17,813 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:19:17,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933531452] [2025-01-09 08:19:17,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933531452] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:17,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:17,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:17,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683554274] [2025-01-09 08:19:17,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:17,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:17,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:17,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:17,814 INFO L87 Difference]: Start difference. First operand 240 states and 331 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:17,872 INFO L93 Difference]: Finished difference Result 444 states and 607 transitions. [2025-01-09 08:19:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:17,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-09 08:19:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:17,874 INFO L225 Difference]: With dead ends: 444 [2025-01-09 08:19:17,874 INFO L226 Difference]: Without dead ends: 262 [2025-01-09 08:19:17,876 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:19:17,876 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 319 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:17,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-01-09 08:19:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 230. [2025-01-09 08:19:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3755458515283843) internal successors, (315), 229 states have internal predecessors, (315), 0 states have call successors, (0), 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:19:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 315 transitions. [2025-01-09 08:19:17,887 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 315 transitions. Word has length 51 [2025-01-09 08:19:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:17,887 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 315 transitions. [2025-01-09 08:19:17,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 08:19:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 315 transitions. [2025-01-09 08:19:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 08:19:17,888 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:17,888 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:19:17,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 08:19:17,888 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:17,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:17,889 INFO L85 PathProgramCache]: Analyzing trace with hash -131357547, now seen corresponding path program 1 times [2025-01-09 08:19:17,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:17,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855711466] [2025-01-09 08:19:17,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:17,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:17,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 08:19:17,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 08:19:17,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:17,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:18,000 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:19:18,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:18,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855711466] [2025-01-09 08:19:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855711466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:18,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:18,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:18,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642196032] [2025-01-09 08:19:18,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:18,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:18,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:18,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:18,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:18,002 INFO L87 Difference]: Start difference. First operand 230 states and 315 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:19:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:18,027 INFO L93 Difference]: Finished difference Result 430 states and 588 transitions. [2025-01-09 08:19:18,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:18,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:19:18,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:18,032 INFO L225 Difference]: With dead ends: 430 [2025-01-09 08:19:18,032 INFO L226 Difference]: Without dead ends: 246 [2025-01-09 08:19:18,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:18,032 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 4 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:18,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 725 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:18,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-09 08:19:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-01-09 08:19:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 1.3673469387755102) internal successors, (335), 245 states have internal predecessors, (335), 0 states have call successors, (0), 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:19:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 335 transitions. [2025-01-09 08:19:18,043 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 335 transitions. Word has length 52 [2025-01-09 08:19:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:18,043 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 335 transitions. [2025-01-09 08:19:18,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:19:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 335 transitions. [2025-01-09 08:19:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-09 08:19:18,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:18,044 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:19:18,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 08:19:18,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:18,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash -553739812, now seen corresponding path program 1 times [2025-01-09 08:19:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:18,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106973930] [2025-01-09 08:19:18,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:18,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 08:19:18,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 08:19:18,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:18,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:18,145 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:19:18,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106973930] [2025-01-09 08:19:18,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106973930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:18,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:18,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394280061] [2025-01-09 08:19:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:18,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:18,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:18,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:18,148 INFO L87 Difference]: Start difference. First operand 246 states and 335 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:19:18,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:18,208 INFO L93 Difference]: Finished difference Result 467 states and 631 transitions. [2025-01-09 08:19:18,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:18,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:19:18,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:18,210 INFO L225 Difference]: With dead ends: 467 [2025-01-09 08:19:18,210 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 08:19:18,210 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:19:18,211 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 311 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:18,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 08:19:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 236. [2025-01-09 08:19:18,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 0 states have call successors, (0), 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:19:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 319 transitions. [2025-01-09 08:19:18,233 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 319 transitions. Word has length 52 [2025-01-09 08:19:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:18,234 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 319 transitions. [2025-01-09 08:19:18,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 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:19:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 319 transitions. [2025-01-09 08:19:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 08:19:18,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:18,234 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:19:18,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 08:19:18,234 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:18,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1014688366, now seen corresponding path program 1 times [2025-01-09 08:19:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262338782] [2025-01-09 08:19:18,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:18,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 08:19:18,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 08:19:18,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:18,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:18,354 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:19:18,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:18,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262338782] [2025-01-09 08:19:18,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262338782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:19:18,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:19:18,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:19:18,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623605420] [2025-01-09 08:19:18,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:19:18,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:19:18,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:18,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:19:18,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:19:18,357 INFO L87 Difference]: Start difference. First operand 236 states and 319 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:19:18,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:18,414 INFO L93 Difference]: Finished difference Result 437 states and 591 transitions. [2025-01-09 08:19:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:19:18,415 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:19:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:18,416 INFO L225 Difference]: With dead ends: 437 [2025-01-09 08:19:18,416 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 08:19:18,417 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:19:18,417 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 289 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:18,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 528 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:19:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 08:19:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 212. [2025-01-09 08:19:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 0 states have call successors, (0), 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:19:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 289 transitions. [2025-01-09 08:19:18,423 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 289 transitions. Word has length 53 [2025-01-09 08:19:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 289 transitions. [2025-01-09 08:19:18,424 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:19:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 289 transitions. [2025-01-09 08:19:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 08:19:18,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:18,425 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:18,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 08:19:18,426 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1013570968, now seen corresponding path program 1 times [2025-01-09 08:19:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:18,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233940229] [2025-01-09 08:19:18,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:18,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 08:19:18,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 08:19:18,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:18,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:20,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:20,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233940229] [2025-01-09 08:19:20,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233940229] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909135101] [2025-01-09 08:19:20,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:20,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:20,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:20,241 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:19:20,243 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:19:20,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 08:19:20,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 08:19:20,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:20,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:20,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 152 conjuncts are in the unsatisfiable core [2025-01-09 08:19:20,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:23,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:25,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909135101] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:25,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:25,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22, 25] total 54 [2025-01-09 08:19:25,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432410851] [2025-01-09 08:19:25,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:25,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 08:19:25,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:25,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 08:19:25,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2554, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 08:19:25,554 INFO L87 Difference]: Start difference. First operand 212 states and 289 transitions. Second operand has 54 states, 54 states have (on average 5.2407407407407405) internal successors, (283), 54 states have internal predecessors, (283), 0 states have call successors, (0), 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:19:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:29,198 INFO L93 Difference]: Finished difference Result 636 states and 871 transitions. [2025-01-09 08:19:29,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-01-09 08:19:29,198 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.2407407407407405) internal successors, (283), 54 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-01-09 08:19:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:29,201 INFO L225 Difference]: With dead ends: 636 [2025-01-09 08:19:29,201 INFO L226 Difference]: Without dead ends: 474 [2025-01-09 08:19:29,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3944 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1254, Invalid=11628, Unknown=0, NotChecked=0, Total=12882 [2025-01-09 08:19:29,210 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 989 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 2527 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:29,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 3001 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2527 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 08:19:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-01-09 08:19:29,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 359. [2025-01-09 08:19:29,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.3519553072625698) internal successors, (484), 358 states have internal predecessors, (484), 0 states have call successors, (0), 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:19:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 484 transitions. [2025-01-09 08:19:29,220 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 484 transitions. Word has length 99 [2025-01-09 08:19:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:29,220 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 484 transitions. [2025-01-09 08:19:29,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.2407407407407405) internal successors, (283), 54 states have internal predecessors, (283), 0 states have call successors, (0), 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:19:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 484 transitions. [2025-01-09 08:19:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 08:19:29,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:29,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:29,233 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:19:29,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 08:19:29,426 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:29,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:29,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1576973281, now seen corresponding path program 1 times [2025-01-09 08:19:29,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:29,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005484575] [2025-01-09 08:19:29,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:29,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:29,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 08:19:29,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 08:19:29,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:29,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:31,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:31,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005484575] [2025-01-09 08:19:31,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005484575] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:31,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140955994] [2025-01-09 08:19:31,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:31,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:31,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:31,266 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:19:31,268 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:19:31,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 08:19:31,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 08:19:31,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:31,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:31,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 186 conjuncts are in the unsatisfiable core [2025-01-09 08:19:31,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:33,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:33,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:38,487 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:38,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140955994] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:38,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:38,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 24] total 62 [2025-01-09 08:19:38,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669396482] [2025-01-09 08:19:38,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:38,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-09 08:19:38,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:38,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-09 08:19:38,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3378, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 08:19:38,490 INFO L87 Difference]: Start difference. First operand 359 states and 484 transitions. Second operand has 62 states, 62 states have (on average 4.596774193548387) internal successors, (285), 62 states have internal predecessors, (285), 0 states have call successors, (0), 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:19:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:43,734 INFO L93 Difference]: Finished difference Result 1057 states and 1446 transitions. [2025-01-09 08:19:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-01-09 08:19:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 4.596774193548387) internal successors, (285), 62 states have internal predecessors, (285), 0 states have call successors, (0), 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 100 [2025-01-09 08:19:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:43,737 INFO L225 Difference]: With dead ends: 1057 [2025-01-09 08:19:43,737 INFO L226 Difference]: Without dead ends: 780 [2025-01-09 08:19:43,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5765 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1960, Invalid=17780, Unknown=0, NotChecked=0, Total=19740 [2025-01-09 08:19:43,744 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 1493 mSDsluCounter, 3384 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:43,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 3490 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 08:19:43,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-01-09 08:19:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 546. [2025-01-09 08:19:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 1.3541284403669724) internal successors, (738), 545 states have internal predecessors, (738), 0 states have call successors, (0), 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:19:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 738 transitions. [2025-01-09 08:19:43,759 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 738 transitions. Word has length 100 [2025-01-09 08:19:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:43,759 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 738 transitions. [2025-01-09 08:19:43,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 4.596774193548387) internal successors, (285), 62 states have internal predecessors, (285), 0 states have call successors, (0), 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:19:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 738 transitions. [2025-01-09 08:19:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 08:19:43,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:43,763 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:43,773 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:19:43,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 08:19:43,967 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:43,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:43,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2083150738, now seen corresponding path program 1 times [2025-01-09 08:19:43,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:43,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859894848] [2025-01-09 08:19:43,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:43,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:43,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 08:19:44,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 08:19:44,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:44,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:44,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859894848] [2025-01-09 08:19:44,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859894848] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:44,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545643785] [2025-01-09 08:19:44,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:44,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:44,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:44,827 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:19:44,830 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:19:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 08:19:45,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 08:19:45,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:45,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:45,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-01-09 08:19:45,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:46,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:47,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545643785] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:47,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:47,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 21] total 48 [2025-01-09 08:19:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147084754] [2025-01-09 08:19:47,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:47,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 08:19:47,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:47,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 08:19:47,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 08:19:47,785 INFO L87 Difference]: Start difference. First operand 546 states and 738 transitions. Second operand has 48 states, 48 states have (on average 5.958333333333333) internal successors, (286), 48 states have internal predecessors, (286), 0 states have call successors, (0), 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:19:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:19:52,564 INFO L93 Difference]: Finished difference Result 2106 states and 2854 transitions. [2025-01-09 08:19:52,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-01-09 08:19:52,565 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 5.958333333333333) internal successors, (286), 48 states have internal predecessors, (286), 0 states have call successors, (0), 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 100 [2025-01-09 08:19:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:19:52,571 INFO L225 Difference]: With dead ends: 2106 [2025-01-09 08:19:52,571 INFO L226 Difference]: Without dead ends: 1791 [2025-01-09 08:19:52,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6350 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2459, Invalid=17001, Unknown=0, NotChecked=0, Total=19460 [2025-01-09 08:19:52,577 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1498 mSDsluCounter, 6914 mSDsCounter, 0 mSdLazyCounter, 4027 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 7189 SdHoareTripleChecker+Invalid, 4045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:19:52,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 7189 Invalid, 4045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4027 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 08:19:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2025-01-09 08:19:52,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 832. [2025-01-09 08:19:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.3465703971119134) internal successors, (1119), 831 states have internal predecessors, (1119), 0 states have call successors, (0), 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:19:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1119 transitions. [2025-01-09 08:19:52,599 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1119 transitions. Word has length 100 [2025-01-09 08:19:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:19:52,599 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1119 transitions. [2025-01-09 08:19:52,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.958333333333333) internal successors, (286), 48 states have internal predecessors, (286), 0 states have call successors, (0), 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:19:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1119 transitions. [2025-01-09 08:19:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 08:19:52,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:19:52,601 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:52,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 08:19:52,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:52,806 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:19:52,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:19:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1224472682, now seen corresponding path program 1 times [2025-01-09 08:19:52,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:19:52,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795022175] [2025-01-09 08:19:52,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:19:52,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 08:19:53,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 08:19:53,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:53,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:54,260 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:19:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795022175] [2025-01-09 08:19:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795022175] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:19:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035054263] [2025-01-09 08:19:54,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:19:54,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:19:54,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:19:54,263 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:19:54,265 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:19:54,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 08:19:54,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 08:19:54,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:19:54,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:19:54,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-01-09 08:19:54,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:19:55,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:55,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:19:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:19:56,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035054263] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:19:56,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:19:56,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 20] total 50 [2025-01-09 08:19:56,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389919511] [2025-01-09 08:19:56,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:19:56,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-01-09 08:19:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:19:56,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-01-09 08:19:56,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2025-01-09 08:19:56,912 INFO L87 Difference]: Start difference. First operand 832 states and 1119 transitions. Second operand has 50 states, 50 states have (on average 5.66) internal successors, (283), 50 states have internal predecessors, (283), 0 states have call successors, (0), 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:20:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:02,323 INFO L93 Difference]: Finished difference Result 2066 states and 2803 transitions. [2025-01-09 08:20:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-01-09 08:20:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.66) internal successors, (283), 50 states have internal predecessors, (283), 0 states have call successors, (0), 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 101 [2025-01-09 08:20:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:02,327 INFO L225 Difference]: With dead ends: 2066 [2025-01-09 08:20:02,328 INFO L226 Difference]: Without dead ends: 1544 [2025-01-09 08:20:02,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5435 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1769, Invalid=18823, Unknown=0, NotChecked=0, Total=20592 [2025-01-09 08:20:02,330 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 2334 mSDsluCounter, 4411 mSDsCounter, 0 mSdLazyCounter, 4241 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 4561 SdHoareTripleChecker+Invalid, 4273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:02,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2334 Valid, 4561 Invalid, 4273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4241 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 08:20:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-01-09 08:20:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1146. [2025-01-09 08:20:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.3362445414847162) internal successors, (1530), 1145 states have internal predecessors, (1530), 0 states have call successors, (0), 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:20:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1530 transitions. [2025-01-09 08:20:02,356 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1530 transitions. Word has length 101 [2025-01-09 08:20:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:02,357 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1530 transitions. [2025-01-09 08:20:02,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.66) internal successors, (283), 50 states have internal predecessors, (283), 0 states have call successors, (0), 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:20:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1530 transitions. [2025-01-09 08:20:02,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 08:20:02,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:02,359 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:02,370 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:20:02,559 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,SelfDestructingSolverStorable17 [2025-01-09 08:20:02,560 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:02,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1373936955, now seen corresponding path program 1 times [2025-01-09 08:20:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:02,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421823323] [2025-01-09 08:20:02,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:02,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:02,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 08:20:02,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 08:20:02,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:02,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421823323] [2025-01-09 08:20:04,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421823323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:20:04,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187928021] [2025-01-09 08:20:04,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:04,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:04,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:04,085 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:20:04,086 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:20:04,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 08:20:04,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 08:20:04,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:04,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:04,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-01-09 08:20:04,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:05,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:20:06,601 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:06,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187928021] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:20:06,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:20:06,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 15] total 38 [2025-01-09 08:20:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435579834] [2025-01-09 08:20:06,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:20:06,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 08:20:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:06,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 08:20:06,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2025-01-09 08:20:06,603 INFO L87 Difference]: Start difference. First operand 1146 states and 1530 transitions. Second operand has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 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:20:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:07,912 INFO L93 Difference]: Finished difference Result 2131 states and 2862 transitions. [2025-01-09 08:20:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 08:20:07,912 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 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 101 [2025-01-09 08:20:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:07,915 INFO L225 Difference]: With dead ends: 2131 [2025-01-09 08:20:07,915 INFO L226 Difference]: Without dead ends: 1247 [2025-01-09 08:20:07,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=585, Invalid=3447, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 08:20:07,917 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1170 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:07,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 1852 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2025-01-09 08:20:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 947. [2025-01-09 08:20:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 946 states have (on average 1.3456659619450317) internal successors, (1273), 946 states have internal predecessors, (1273), 0 states have call successors, (0), 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:20:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1273 transitions. [2025-01-09 08:20:07,937 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1273 transitions. Word has length 101 [2025-01-09 08:20:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:07,939 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1273 transitions. [2025-01-09 08:20:07,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 7.315789473684211) internal successors, (278), 38 states have internal predecessors, (278), 0 states have call successors, (0), 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:20:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1273 transitions. [2025-01-09 08:20:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 08:20:07,940 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:07,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:07,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 08:20:08,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:08,145 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:08,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:08,146 INFO L85 PathProgramCache]: Analyzing trace with hash 296144241, now seen corresponding path program 1 times [2025-01-09 08:20:08,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:08,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944167366] [2025-01-09 08:20:08,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:08,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:08,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 08:20:08,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 08:20:08,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:08,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:09,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944167366] [2025-01-09 08:20:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944167366] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:20:09,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111032770] [2025-01-09 08:20:09,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:20:09,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:09,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:09,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:09,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 08:20:09,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 08:20:10,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 08:20:10,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:20:10,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:10,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-01-09 08:20:10,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:11,031 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:20:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:12,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111032770] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:20:12,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:20:12,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 35 [2025-01-09 08:20:12,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989331461] [2025-01-09 08:20:12,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:20:12,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 08:20:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:12,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 08:20:12,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 08:20:12,564 INFO L87 Difference]: Start difference. First operand 947 states and 1273 transitions. Second operand has 35 states, 35 states have (on average 7.857142857142857) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 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:20:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:20:14,075 INFO L93 Difference]: Finished difference Result 1825 states and 2449 transitions. [2025-01-09 08:20:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 08:20:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 7.857142857142857) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 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 102 [2025-01-09 08:20:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:20:14,079 INFO L225 Difference]: With dead ends: 1825 [2025-01-09 08:20:14,080 INFO L226 Difference]: Without dead ends: 1009 [2025-01-09 08:20:14,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=586, Invalid=3970, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 08:20:14,082 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 553 mSDsluCounter, 2150 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 08:20:14,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 2265 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 08:20:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2025-01-09 08:20:14,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 925. [2025-01-09 08:20:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.3474025974025974) internal successors, (1245), 924 states have internal predecessors, (1245), 0 states have call successors, (0), 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:20:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1245 transitions. [2025-01-09 08:20:14,100 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1245 transitions. Word has length 102 [2025-01-09 08:20:14,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:20:14,100 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1245 transitions. [2025-01-09 08:20:14,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.857142857142857) internal successors, (275), 35 states have internal predecessors, (275), 0 states have call successors, (0), 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:20:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1245 transitions. [2025-01-09 08:20:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 08:20:14,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:20:14,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:20:14,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 08:20:14,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:14,304 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:20:14,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:20:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1122330496, now seen corresponding path program 2 times [2025-01-09 08:20:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:20:14,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014966671] [2025-01-09 08:20:14,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 08:20:14,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:20:14,349 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-01-09 08:20:15,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 08:20:15,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 08:20:15,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:19,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:20:19,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014966671] [2025-01-09 08:20:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014966671] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:20:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214115792] [2025-01-09 08:20:19,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 08:20:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:20:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:20:19,964 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 08:20:19,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 08:20:20,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-01-09 08:20:20,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 08:20:20,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 08:20:20,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:20:20,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 133 conjuncts are in the unsatisfiable core [2025-01-09 08:20:20,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:20:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 37 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:22,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:20:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 10 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 08:20:24,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214115792] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:20:24,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:20:24,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 66 [2025-01-09 08:20:24,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636169998] [2025-01-09 08:20:24,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:20:24,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-01-09 08:20:24,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:20:24,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-01-09 08:20:24,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=3960, Unknown=0, NotChecked=0, Total=4290 [2025-01-09 08:20:24,675 INFO L87 Difference]: Start difference. First operand 925 states and 1245 transitions. Second operand has 66 states, 66 states have (on average 6.5606060606060606) internal successors, (433), 66 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)