./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-60.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b17bfee826ea574d9167da2b4a5bf955c821c1f041af44a4ed8a7abf38eb1376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:48:48,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:48:48,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:48:48,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:48:48,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:48:48,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:48:48,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:48:48,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:48:48,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:48:48,565 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:48:48,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:48:48,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:48:48,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:48:48,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:48:48,565 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:48:48,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:48:48,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:48:48,565 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:48:48,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:48:48,567 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:48:48,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:48:48,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:48:48,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:48:48,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:48,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:48:48,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:48:48,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:48:48,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:48:48,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:48,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:48:48,568 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b17bfee826ea574d9167da2b4a5bf955c821c1f041af44a4ed8a7abf38eb1376 [2025-01-09 14:48:48,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:48:48,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:48:48,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:48:48,834 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:48:48,834 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:48:48,835 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-60.i [2025-01-09 14:48:49,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08eb6fbe4/53a24c7e018e4563aabe678921be20c6/FLAG1c06bb621 [2025-01-09 14:48:50,290 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:48:50,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-60.i [2025-01-09 14:48:50,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08eb6fbe4/53a24c7e018e4563aabe678921be20c6/FLAG1c06bb621 [2025-01-09 14:48:50,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/08eb6fbe4/53a24c7e018e4563aabe678921be20c6 [2025-01-09 14:48:50,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:48:50,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:48:50,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:48:50,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:48:50,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:48:50,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:50,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a047013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50, skipping insertion in model container [2025-01-09 14:48:50,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:50,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:48:50,674 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/hardness-nfm22/hardness_operatoramount_amount500_file-60.i[916,929] [2025-01-09 14:48:50,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:48:50,850 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:48:50,857 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/hardness-nfm22/hardness_operatoramount_amount500_file-60.i[916,929] [2025-01-09 14:48:50,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:48:50,961 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:48:50,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50 WrapperNode [2025-01-09 14:48:50,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:48:50,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:48:50,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:48:50,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:48:50,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:50,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,101 INFO L138 Inliner]: procedures = 26, calls = 80, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 812 [2025-01-09 14:48:51,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:48:51,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:48:51,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:48:51,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:48:51,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,215 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 14:48:51,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,244 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:48:51,312 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:48:51,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:48:51,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:48:51,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (1/1) ... [2025-01-09 14:48:51,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:48:51,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:51,342 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 14:48:51,353 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 14:48:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:48:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:48:51,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:48:51,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:48:51,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:48:51,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:48:51,516 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:48:51,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:48:52,593 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-01-09 14:48:52,594 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:48:52,610 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:48:52,610 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:48:52,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:52 BoogieIcfgContainer [2025-01-09 14:48:52,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:48:52,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:48:52,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:48:52,618 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:48:52,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:48:50" (1/3) ... [2025-01-09 14:48:52,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e91226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:52, skipping insertion in model container [2025-01-09 14:48:52,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:48:50" (2/3) ... [2025-01-09 14:48:52,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e91226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:48:52, skipping insertion in model container [2025-01-09 14:48:52,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:48:52" (3/3) ... [2025-01-09 14:48:52,620 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-60.i [2025-01-09 14:48:52,632 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:48:52,636 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-60.i that has 2 procedures, 327 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:48:52,696 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:48:52,706 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;@1ab303f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:48:52,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:48:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 327 states, 257 states have (on average 1.5642023346303502) internal successors, (402), 258 states have internal predecessors, (402), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:48:52,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-01-09 14:48:52,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:52,736 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:52,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:52,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash 369967820, now seen corresponding path program 1 times [2025-01-09 14:48:52,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:52,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568714684] [2025-01-09 14:48:52,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:52,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 14:48:52,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 14:48:52,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:52,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 14:48:53,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568714684] [2025-01-09 14:48:53,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568714684] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:48:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705081165] [2025-01-09 14:48:53,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:53,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:48:53,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:48:53,354 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 14:48:53,355 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 14:48:53,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-01-09 14:48:53,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-01-09 14:48:53,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:53,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:53,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:48:53,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:48:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 8712 trivial. 0 not checked. [2025-01-09 14:48:53,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:48:53,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705081165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:53,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:48:53,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:48:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502812421] [2025-01-09 14:48:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:53,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:48:53,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:53,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:48:53,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:48:53,796 INFO L87 Difference]: Start difference. First operand has 327 states, 257 states have (on average 1.5642023346303502) internal successors, (402), 258 states have internal predecessors, (402), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) Second operand has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:48:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:53,849 INFO L93 Difference]: Finished difference Result 648 states and 1134 transitions. [2025-01-09 14:48:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:48:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) Word has length 489 [2025-01-09 14:48:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:53,858 INFO L225 Difference]: With dead ends: 648 [2025-01-09 14:48:53,859 INFO L226 Difference]: Without dead ends: 324 [2025-01-09 14:48:53,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:48:53,868 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:53,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-01-09 14:48:53,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-01-09 14:48:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 255 states have (on average 1.5490196078431373) internal successors, (395), 255 states have internal predecessors, (395), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:48:53,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 529 transitions. [2025-01-09 14:48:53,931 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 529 transitions. Word has length 489 [2025-01-09 14:48:53,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:53,932 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 529 transitions. [2025-01-09 14:48:53,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.5) internal successors, (159), 2 states have internal predecessors, (159), 2 states have call successors, (67), 2 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 2 states have call successors, (67) [2025-01-09 14:48:53,932 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 529 transitions. [2025-01-09 14:48:53,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:48:53,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:53,939 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:53,947 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 14:48:54,143 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,SelfDestructingSolverStorable0 [2025-01-09 14:48:54,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:54,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:54,144 INFO L85 PathProgramCache]: Analyzing trace with hash -706317130, now seen corresponding path program 1 times [2025-01-09 14:48:54,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:54,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391383438] [2025-01-09 14:48:54,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:54,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:54,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:48:54,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:48:54,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:54,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:48:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391383438] [2025-01-09 14:48:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391383438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:54,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:54,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:48:54,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455582301] [2025-01-09 14:48:54,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:54,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:48:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:54,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:48:54,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:48:54,933 INFO L87 Difference]: Start difference. First operand 324 states and 529 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:54,993 INFO L93 Difference]: Finished difference Result 647 states and 1058 transitions. [2025-01-09 14:48:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:48:54,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2025-01-09 14:48:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:55,005 INFO L225 Difference]: With dead ends: 647 [2025-01-09 14:48:55,005 INFO L226 Difference]: Without dead ends: 326 [2025-01-09 14:48:55,006 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 14:48:55,007 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 1046 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:55,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1573 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-01-09 14:48:55,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2025-01-09 14:48:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 257 states have (on average 1.5447470817120623) internal successors, (397), 257 states have internal predecessors, (397), 67 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 14:48:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 531 transitions. [2025-01-09 14:48:55,027 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 531 transitions. Word has length 490 [2025-01-09 14:48:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:55,029 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 531 transitions. [2025-01-09 14:48:55,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 531 transitions. [2025-01-09 14:48:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:48:55,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:55,034 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:55,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:48:55,035 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:55,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1123713736, now seen corresponding path program 1 times [2025-01-09 14:48:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:55,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858675157] [2025-01-09 14:48:55,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:55,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:55,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:48:55,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:48:55,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:55,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:48:55,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858675157] [2025-01-09 14:48:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858675157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:55,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:55,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:48:55,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149420551] [2025-01-09 14:48:55,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:55,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:48:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:55,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:48:55,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:55,387 INFO L87 Difference]: Start difference. First operand 326 states and 531 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:55,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:55,474 INFO L93 Difference]: Finished difference Result 970 states and 1583 transitions. [2025-01-09 14:48:55,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:48:55,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2025-01-09 14:48:55,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:55,481 INFO L225 Difference]: With dead ends: 970 [2025-01-09 14:48:55,481 INFO L226 Difference]: Without dead ends: 647 [2025-01-09 14:48:55,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:48:55,485 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 508 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:55,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 1355 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:48:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-01-09 14:48:55,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 645. [2025-01-09 14:48:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 508 states have (on average 1.5413385826771653) internal successors, (783), 508 states have internal predecessors, (783), 134 states have call successors, (134), 2 states have call predecessors, (134), 2 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 14:48:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1051 transitions. [2025-01-09 14:48:55,536 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1051 transitions. Word has length 490 [2025-01-09 14:48:55,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:55,538 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 1051 transitions. [2025-01-09 14:48:55,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:55,540 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1051 transitions. [2025-01-09 14:48:55,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:48:55,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:55,545 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:55,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:48:55,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:55,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:55,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1121926200, now seen corresponding path program 1 times [2025-01-09 14:48:55,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:55,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402574080] [2025-01-09 14:48:55,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:55,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:55,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:48:55,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:48:55,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:55,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:48:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402574080] [2025-01-09 14:48:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402574080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:56,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:48:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914958561] [2025-01-09 14:48:56,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:56,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:48:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:56,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:48:56,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:48:56,351 INFO L87 Difference]: Start difference. First operand 645 states and 1051 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:57,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:57,013 INFO L93 Difference]: Finished difference Result 3333 states and 5429 transitions. [2025-01-09 14:48:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:48:57,014 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2025-01-09 14:48:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:57,031 INFO L225 Difference]: With dead ends: 3333 [2025-01-09 14:48:57,031 INFO L226 Difference]: Without dead ends: 2691 [2025-01-09 14:48:57,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:48:57,035 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 1819 mSDsluCounter, 2473 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:57,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 3392 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:48:57,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2025-01-09 14:48:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2263. [2025-01-09 14:48:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 1910 states have (on average 1.568586387434555) internal successors, (2996), 1914 states have internal predecessors, (2996), 344 states have call successors, (344), 8 states have call predecessors, (344), 8 states have return successors, (344), 340 states have call predecessors, (344), 344 states have call successors, (344) [2025-01-09 14:48:57,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3684 transitions. [2025-01-09 14:48:57,175 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3684 transitions. Word has length 490 [2025-01-09 14:48:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:57,176 INFO L471 AbstractCegarLoop]: Abstraction has 2263 states and 3684 transitions. [2025-01-09 14:48:57,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3684 transitions. [2025-01-09 14:48:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:48:57,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:57,183 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:57,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:48:57,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:57,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash 65194998, now seen corresponding path program 1 times [2025-01-09 14:48:57,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:57,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98706560] [2025-01-09 14:48:57,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:57,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:48:57,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:48:57,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:57,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:48:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:48:58,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:48:58,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98706560] [2025-01-09 14:48:58,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98706560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:48:58,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:48:58,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:48:58,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12390373] [2025-01-09 14:48:58,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:48:58,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:48:58,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:48:58,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:48:58,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:48:58,714 INFO L87 Difference]: Start difference. First operand 2263 states and 3684 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:48:59,340 INFO L93 Difference]: Finished difference Result 5979 states and 9732 transitions. [2025-01-09 14:48:59,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:48:59,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2025-01-09 14:48:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:48:59,358 INFO L225 Difference]: With dead ends: 5979 [2025-01-09 14:48:59,358 INFO L226 Difference]: Without dead ends: 3719 [2025-01-09 14:48:59,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:48:59,364 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 441 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1924 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:48:59,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1924 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:48:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2025-01-09 14:48:59,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 2441. [2025-01-09 14:48:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2441 states, 2020 states have (on average 1.5594059405940595) internal successors, (3150), 2024 states have internal predecessors, (3150), 411 states have call successors, (411), 9 states have call predecessors, (411), 9 states have return successors, (411), 407 states have call predecessors, (411), 411 states have call successors, (411) [2025-01-09 14:48:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2441 states to 2441 states and 3972 transitions. [2025-01-09 14:48:59,532 INFO L78 Accepts]: Start accepts. Automaton has 2441 states and 3972 transitions. Word has length 490 [2025-01-09 14:48:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:48:59,533 INFO L471 AbstractCegarLoop]: Abstraction has 2441 states and 3972 transitions. [2025-01-09 14:48:59,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:48:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2441 states and 3972 transitions. [2025-01-09 14:48:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:48:59,542 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:48:59,543 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:59,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:48:59,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:48:59,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:48:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash -126286274, now seen corresponding path program 1 times [2025-01-09 14:48:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:48:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555915677] [2025-01-09 14:48:59,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:48:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:48:59,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:48:59,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:48:59,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:48:59,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:01,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:01,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555915677] [2025-01-09 14:49:01,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555915677] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:01,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:01,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 14:49:01,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080908906] [2025-01-09 14:49:01,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:01,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 14:49:01,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:01,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 14:49:01,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:49:01,106 INFO L87 Difference]: Start difference. First operand 2441 states and 3972 transitions. Second operand has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-01-09 14:49:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:05,251 INFO L93 Difference]: Finished difference Result 18377 states and 29535 transitions. [2025-01-09 14:49:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 14:49:05,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 490 [2025-01-09 14:49:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:05,345 INFO L225 Difference]: With dead ends: 18377 [2025-01-09 14:49:05,349 INFO L226 Difference]: Without dead ends: 16117 [2025-01-09 14:49:05,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:49:05,366 INFO L435 NwaCegarLoop]: 1410 mSDtfsCounter, 4600 mSDsluCounter, 4140 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 1257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4600 SdHoareTripleChecker+Valid, 5550 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1257 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:05,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4600 Valid, 5550 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1257 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 14:49:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16117 states. [2025-01-09 14:49:05,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16117 to 8867. [2025-01-09 14:49:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8867 states, 7870 states have (on average 1.576874205844981) internal successors, (12410), 7886 states have internal predecessors, (12410), 971 states have call successors, (971), 25 states have call predecessors, (971), 25 states have return successors, (971), 955 states have call predecessors, (971), 971 states have call successors, (971) [2025-01-09 14:49:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8867 states to 8867 states and 14352 transitions. [2025-01-09 14:49:06,024 INFO L78 Accepts]: Start accepts. Automaton has 8867 states and 14352 transitions. Word has length 490 [2025-01-09 14:49:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:06,025 INFO L471 AbstractCegarLoop]: Abstraction has 8867 states and 14352 transitions. [2025-01-09 14:49:06,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.363636363636363) internal successors, (158), 11 states have internal predecessors, (158), 3 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2025-01-09 14:49:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 8867 states and 14352 transitions. [2025-01-09 14:49:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:49:06,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:06,038 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:49:06,038 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:06,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash 712747388, now seen corresponding path program 1 times [2025-01-09 14:49:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627677736] [2025-01-09 14:49:06,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:06,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:49:06,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:49:06,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:06,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:06,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:06,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627677736] [2025-01-09 14:49:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627677736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:06,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:06,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542545844] [2025-01-09 14:49:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:06,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:06,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:06,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:06,262 INFO L87 Difference]: Start difference. First operand 8867 states and 14352 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:06,531 INFO L93 Difference]: Finished difference Result 22895 states and 37110 transitions. [2025-01-09 14:49:06,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:06,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2025-01-09 14:49:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:06,572 INFO L225 Difference]: With dead ends: 22895 [2025-01-09 14:49:06,572 INFO L226 Difference]: Without dead ends: 14233 [2025-01-09 14:49:06,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:06,590 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 521 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:06,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1490 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14233 states. [2025-01-09 14:49:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14233 to 9035. [2025-01-09 14:49:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9035 states, 8038 states have (on average 1.5767603881562577) internal successors, (12674), 8054 states have internal predecessors, (12674), 971 states have call successors, (971), 25 states have call predecessors, (971), 25 states have return successors, (971), 955 states have call predecessors, (971), 971 states have call successors, (971) [2025-01-09 14:49:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9035 states to 9035 states and 14616 transitions. [2025-01-09 14:49:07,054 INFO L78 Accepts]: Start accepts. Automaton has 9035 states and 14616 transitions. Word has length 490 [2025-01-09 14:49:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:07,055 INFO L471 AbstractCegarLoop]: Abstraction has 9035 states and 14616 transitions. [2025-01-09 14:49:07,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 9035 states and 14616 transitions. [2025-01-09 14:49:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:49:07,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:07,068 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:07,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:49:07,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:07,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash 952987134, now seen corresponding path program 1 times [2025-01-09 14:49:07,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:07,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726833887] [2025-01-09 14:49:07,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:07,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:07,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:49:07,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:49:07,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:07,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:07,702 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:07,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:07,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726833887] [2025-01-09 14:49:07,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726833887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:07,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:07,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:07,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968344682] [2025-01-09 14:49:07,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:07,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:07,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:07,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:07,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:07,704 INFO L87 Difference]: Start difference. First operand 9035 states and 14616 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:08,497 INFO L93 Difference]: Finished difference Result 30853 states and 49491 transitions. [2025-01-09 14:49:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:08,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2025-01-09 14:49:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:08,549 INFO L225 Difference]: With dead ends: 30853 [2025-01-09 14:49:08,549 INFO L226 Difference]: Without dead ends: 22023 [2025-01-09 14:49:08,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:08,570 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 809 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:08,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 1705 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:49:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22023 states. [2025-01-09 14:49:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22023 to 16851. [2025-01-09 14:49:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16851 states, 15326 states have (on average 1.5723606942450736) internal successors, (24098), 15366 states have internal predecessors, (24098), 1475 states have call successors, (1475), 49 states have call predecessors, (1475), 49 states have return successors, (1475), 1435 states have call predecessors, (1475), 1475 states have call successors, (1475) [2025-01-09 14:49:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16851 states to 16851 states and 27048 transitions. [2025-01-09 14:49:09,192 INFO L78 Accepts]: Start accepts. Automaton has 16851 states and 27048 transitions. Word has length 490 [2025-01-09 14:49:09,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:09,194 INFO L471 AbstractCegarLoop]: Abstraction has 16851 states and 27048 transitions. [2025-01-09 14:49:09,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:09,195 INFO L276 IsEmpty]: Start isEmpty. Operand 16851 states and 27048 transitions. [2025-01-09 14:49:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:49:09,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:09,215 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:09,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:49:09,216 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:09,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2084861060, now seen corresponding path program 1 times [2025-01-09 14:49:09,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:09,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515234131] [2025-01-09 14:49:09,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:09,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:09,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:49:09,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:49:09,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:09,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:09,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:09,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515234131] [2025-01-09 14:49:09,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515234131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:09,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:09,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278611556] [2025-01-09 14:49:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:09,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:09,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:09,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:09,979 INFO L87 Difference]: Start difference. First operand 16851 states and 27048 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:10,886 INFO L93 Difference]: Finished difference Result 78579 states and 126012 transitions. [2025-01-09 14:49:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:49:10,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2025-01-09 14:49:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:11,020 INFO L225 Difference]: With dead ends: 78579 [2025-01-09 14:49:11,020 INFO L226 Difference]: Without dead ends: 61949 [2025-01-09 14:49:11,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:11,060 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 1419 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:11,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1419 Valid, 1905 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:49:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61949 states. [2025-01-09 14:49:12,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61949 to 61287. [2025-01-09 14:49:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61287 states, 57730 states have (on average 1.5789710722328079) internal successors, (91154), 57906 states have internal predecessors, (91154), 3363 states have call successors, (3363), 193 states have call predecessors, (3363), 193 states have return successors, (3363), 3187 states have call predecessors, (3363), 3363 states have call successors, (3363) [2025-01-09 14:49:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61287 states to 61287 states and 97880 transitions. [2025-01-09 14:49:13,260 INFO L78 Accepts]: Start accepts. Automaton has 61287 states and 97880 transitions. Word has length 490 [2025-01-09 14:49:13,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:13,261 INFO L471 AbstractCegarLoop]: Abstraction has 61287 states and 97880 transitions. [2025-01-09 14:49:13,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:13,262 INFO L276 IsEmpty]: Start isEmpty. Operand 61287 states and 97880 transitions. [2025-01-09 14:49:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 14:49:13,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:13,319 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:13,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:49:13,319 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:13,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash 159834940, now seen corresponding path program 1 times [2025-01-09 14:49:13,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:13,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931984162] [2025-01-09 14:49:13,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:13,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:13,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 14:49:13,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 14:49:13,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:13,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:13,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:13,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931984162] [2025-01-09 14:49:13,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931984162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:13,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:13,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:49:13,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743733983] [2025-01-09 14:49:13,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:13,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:49:13,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:13,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:49:13,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:49:13,993 INFO L87 Difference]: Start difference. First operand 61287 states and 97880 transitions. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:16,104 INFO L93 Difference]: Finished difference Result 136161 states and 217560 transitions. [2025-01-09 14:49:16,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 14:49:16,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 490 [2025-01-09 14:49:16,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:16,263 INFO L225 Difference]: With dead ends: 136161 [2025-01-09 14:49:16,264 INFO L226 Difference]: Without dead ends: 75095 [2025-01-09 14:49:16,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-01-09 14:49:16,306 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 1792 mSDsluCounter, 2805 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:16,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1792 Valid, 3942 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:49:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75095 states. [2025-01-09 14:49:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75095 to 61291. [2025-01-09 14:49:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61291 states, 57733 states have (on average 1.5722896783468727) internal successors, (90773), 57909 states have internal predecessors, (90773), 3363 states have call successors, (3363), 194 states have call predecessors, (3363), 194 states have return successors, (3363), 3187 states have call predecessors, (3363), 3363 states have call successors, (3363) [2025-01-09 14:49:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61291 states to 61291 states and 97499 transitions. [2025-01-09 14:49:18,310 INFO L78 Accepts]: Start accepts. Automaton has 61291 states and 97499 transitions. Word has length 490 [2025-01-09 14:49:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:18,311 INFO L471 AbstractCegarLoop]: Abstraction has 61291 states and 97499 transitions. [2025-01-09 14:49:18,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 61291 states and 97499 transitions. [2025-01-09 14:49:18,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 14:49:18,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:18,352 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:18,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 14:49:18,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:18,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1682698657, now seen corresponding path program 1 times [2025-01-09 14:49:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844580652] [2025-01-09 14:49:18,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:18,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 14:49:18,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 14:49:18,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:18,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:18,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:18,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844580652] [2025-01-09 14:49:18,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844580652] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:18,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:18,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277441418] [2025-01-09 14:49:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:18,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:18,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:18,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:18,642 INFO L87 Difference]: Start difference. First operand 61291 states and 97499 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:19,833 INFO L93 Difference]: Finished difference Result 122357 states and 194652 transitions. [2025-01-09 14:49:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:19,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 491 [2025-01-09 14:49:19,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:19,944 INFO L225 Difference]: With dead ends: 122357 [2025-01-09 14:49:19,944 INFO L226 Difference]: Without dead ends: 61291 [2025-01-09 14:49:20,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:20,004 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:20,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1051 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61291 states. [2025-01-09 14:49:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61291 to 61291. [2025-01-09 14:49:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61291 states, 57733 states have (on average 1.571458264770582) internal successors, (90725), 57909 states have internal predecessors, (90725), 3363 states have call successors, (3363), 194 states have call predecessors, (3363), 194 states have return successors, (3363), 3187 states have call predecessors, (3363), 3363 states have call successors, (3363) [2025-01-09 14:49:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61291 states to 61291 states and 97451 transitions. [2025-01-09 14:49:21,751 INFO L78 Accepts]: Start accepts. Automaton has 61291 states and 97451 transitions. Word has length 491 [2025-01-09 14:49:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:21,752 INFO L471 AbstractCegarLoop]: Abstraction has 61291 states and 97451 transitions. [2025-01-09 14:49:21,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 61291 states and 97451 transitions. [2025-01-09 14:49:21,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 14:49:21,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:21,959 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:21,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 14:49:21,960 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:21,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:21,960 INFO L85 PathProgramCache]: Analyzing trace with hash 625967455, now seen corresponding path program 1 times [2025-01-09 14:49:21,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:21,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237545258] [2025-01-09 14:49:21,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:21,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:21,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 14:49:22,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 14:49:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:22,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237545258] [2025-01-09 14:49:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237545258] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:22,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:22,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:49:22,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539186002] [2025-01-09 14:49:22,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:22,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:49:22,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:22,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:49:22,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:22,482 INFO L87 Difference]: Start difference. First operand 61291 states and 97451 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:23,536 INFO L93 Difference]: Finished difference Result 122413 states and 194652 transitions. [2025-01-09 14:49:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:49:23,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 491 [2025-01-09 14:49:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:23,635 INFO L225 Difference]: With dead ends: 122413 [2025-01-09 14:49:23,635 INFO L226 Difference]: Without dead ends: 61331 [2025-01-09 14:49:23,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:49:23,669 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:23,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1048 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:49:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61331 states. [2025-01-09 14:49:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61331 to 61331. [2025-01-09 14:49:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61331 states, 57773 states have (on average 1.5710626071002025) internal successors, (90765), 57949 states have internal predecessors, (90765), 3363 states have call successors, (3363), 194 states have call predecessors, (3363), 194 states have return successors, (3363), 3187 states have call predecessors, (3363), 3363 states have call successors, (3363) [2025-01-09 14:49:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61331 states to 61331 states and 97491 transitions. [2025-01-09 14:49:25,473 INFO L78 Accepts]: Start accepts. Automaton has 61331 states and 97491 transitions. Word has length 491 [2025-01-09 14:49:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:25,474 INFO L471 AbstractCegarLoop]: Abstraction has 61331 states and 97491 transitions. [2025-01-09 14:49:25,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 61331 states and 97491 transitions. [2025-01-09 14:49:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 14:49:25,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:25,522 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:25,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:49:25,522 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:25,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:25,523 INFO L85 PathProgramCache]: Analyzing trace with hash 2015261469, now seen corresponding path program 1 times [2025-01-09 14:49:25,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:25,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815802141] [2025-01-09 14:49:25,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:25,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:25,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 14:49:25,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 14:49:25,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:25,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:26,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:26,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:26,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815802141] [2025-01-09 14:49:26,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815802141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:26,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:26,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:26,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101364300] [2025-01-09 14:49:26,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:26,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:26,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:26,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:26,453 INFO L87 Difference]: Start difference. First operand 61331 states and 97491 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:27,593 INFO L93 Difference]: Finished difference Result 158344 states and 251645 transitions. [2025-01-09 14:49:27,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:27,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 491 [2025-01-09 14:49:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:27,741 INFO L225 Difference]: With dead ends: 158344 [2025-01-09 14:49:27,741 INFO L226 Difference]: Without dead ends: 97189 [2025-01-09 14:49:27,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:27,827 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 442 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:27,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1552 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:49:27,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97189 states. [2025-01-09 14:49:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97189 to 61491. [2025-01-09 14:49:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61491 states, 57933 states have (on average 1.5711252653927814) internal successors, (91020), 58109 states have internal predecessors, (91020), 3363 states have call successors, (3363), 194 states have call predecessors, (3363), 194 states have return successors, (3363), 3187 states have call predecessors, (3363), 3363 states have call successors, (3363) [2025-01-09 14:49:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61491 states to 61491 states and 97746 transitions. [2025-01-09 14:49:29,850 INFO L78 Accepts]: Start accepts. Automaton has 61491 states and 97746 transitions. Word has length 491 [2025-01-09 14:49:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:29,851 INFO L471 AbstractCegarLoop]: Abstraction has 61491 states and 97746 transitions. [2025-01-09 14:49:29,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 61491 states and 97746 transitions. [2025-01-09 14:49:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 14:49:29,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:29,925 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:29,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 14:49:29,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:29,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:29,925 INFO L85 PathProgramCache]: Analyzing trace with hash -552560865, now seen corresponding path program 1 times [2025-01-09 14:49:29,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:29,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674772780] [2025-01-09 14:49:29,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:29,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:29,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 14:49:30,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 14:49:30,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:30,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:30,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674772780] [2025-01-09 14:49:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674772780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:30,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:30,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480668570] [2025-01-09 14:49:30,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:30,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:30,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:30,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:30,853 INFO L87 Difference]: Start difference. First operand 61491 states and 97746 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:32,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:32,914 INFO L93 Difference]: Finished difference Result 98917 states and 157340 transitions. [2025-01-09 14:49:32,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:32,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 491 [2025-01-09 14:49:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:33,052 INFO L225 Difference]: With dead ends: 98917 [2025-01-09 14:49:33,052 INFO L226 Difference]: Without dead ends: 83239 [2025-01-09 14:49:33,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:33,088 INFO L435 NwaCegarLoop]: 1030 mSDtfsCounter, 713 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:33,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1851 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:49:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83239 states. [2025-01-09 14:49:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83239 to 54519. [2025-01-09 14:49:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54519 states, 51200 states have (on average 1.57716796875) internal successors, (80751), 51328 states have internal predecessors, (80751), 3123 states have call successors, (3123), 195 states have call predecessors, (3123), 195 states have return successors, (3123), 2995 states have call predecessors, (3123), 3123 states have call successors, (3123) [2025-01-09 14:49:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54519 states to 54519 states and 86997 transitions. [2025-01-09 14:49:35,030 INFO L78 Accepts]: Start accepts. Automaton has 54519 states and 86997 transitions. Word has length 491 [2025-01-09 14:49:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:35,030 INFO L471 AbstractCegarLoop]: Abstraction has 54519 states and 86997 transitions. [2025-01-09 14:49:35,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 54519 states and 86997 transitions. [2025-01-09 14:49:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 14:49:35,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:35,054 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:35,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 14:49:35,055 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:35,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -81204515, now seen corresponding path program 1 times [2025-01-09 14:49:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101215996] [2025-01-09 14:49:35,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:35,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 14:49:35,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 14:49:35,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8844 trivial. 0 not checked. [2025-01-09 14:49:35,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:35,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101215996] [2025-01-09 14:49:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101215996] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:49:35,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:49:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:49:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472972478] [2025-01-09 14:49:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:49:35,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:49:35,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:35,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:49:35,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:49:35,949 INFO L87 Difference]: Start difference. First operand 54519 states and 86997 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:37,421 INFO L93 Difference]: Finished difference Result 118269 states and 188568 transitions. [2025-01-09 14:49:37,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:49:37,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) Word has length 491 [2025-01-09 14:49:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:37,541 INFO L225 Difference]: With dead ends: 118269 [2025-01-09 14:49:37,542 INFO L226 Difference]: Without dead ends: 64131 [2025-01-09 14:49:37,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:49:37,602 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 791 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:37,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1802 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:49:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64131 states. [2025-01-09 14:49:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64131 to 55583. [2025-01-09 14:49:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55583 states, 52264 states have (on average 1.575520434716057) internal successors, (82343), 52392 states have internal predecessors, (82343), 3123 states have call successors, (3123), 195 states have call predecessors, (3123), 195 states have return successors, (3123), 2995 states have call predecessors, (3123), 3123 states have call successors, (3123) [2025-01-09 14:49:39,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55583 states to 55583 states and 88589 transitions. [2025-01-09 14:49:39,464 INFO L78 Accepts]: Start accepts. Automaton has 55583 states and 88589 transitions. Word has length 491 [2025-01-09 14:49:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:39,465 INFO L471 AbstractCegarLoop]: Abstraction has 55583 states and 88589 transitions. [2025-01-09 14:49:39,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (67), 1 states have call predecessors, (67), 1 states have return successors, (67), 1 states have call predecessors, (67), 1 states have call successors, (67) [2025-01-09 14:49:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 55583 states and 88589 transitions. [2025-01-09 14:49:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-09 14:49:39,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:39,498 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:39,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 14:49:39,498 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:39,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1322243999, now seen corresponding path program 1 times [2025-01-09 14:49:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:39,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967947997] [2025-01-09 14:49:39,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:39,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:39,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 14:49:40,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 14:49:40,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:40,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:49:40,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:49:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967947997] [2025-01-09 14:49:40,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967947997] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:49:40,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726716261] [2025-01-09 14:49:40,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:40,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:49:40,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:49:40,959 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 14:49:40,960 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 14:49:41,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-09 14:49:41,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-09 14:49:41,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:41,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:49:41,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 14:49:41,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:49:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 4476 proven. 93 refuted. 0 times theorem prover too weak. 4275 trivial. 0 not checked. [2025-01-09 14:49:42,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:49:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8844 backedges. 105 proven. 93 refuted. 0 times theorem prover too weak. 8646 trivial. 0 not checked. [2025-01-09 14:49:42,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726716261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:49:42,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:49:42,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2025-01-09 14:49:42,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109440665] [2025-01-09 14:49:42,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:49:42,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:49:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:49:42,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:49:42,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:49:42,779 INFO L87 Difference]: Start difference. First operand 55583 states and 88589 transitions. Second operand has 16 states, 16 states have (on average 24.25) internal successors, (388), 16 states have internal predecessors, (388), 6 states have call successors, (201), 3 states have call predecessors, (201), 6 states have return successors, (201), 5 states have call predecessors, (201), 6 states have call successors, (201) [2025-01-09 14:49:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:49:46,012 INFO L93 Difference]: Finished difference Result 138885 states and 220343 transitions. [2025-01-09 14:49:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 14:49:46,016 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 24.25) internal successors, (388), 16 states have internal predecessors, (388), 6 states have call successors, (201), 3 states have call predecessors, (201), 6 states have return successors, (201), 5 states have call predecessors, (201), 6 states have call successors, (201) Word has length 491 [2025-01-09 14:49:46,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:49:46,157 INFO L225 Difference]: With dead ends: 138885 [2025-01-09 14:49:46,157 INFO L226 Difference]: Without dead ends: 83683 [2025-01-09 14:49:46,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 976 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 14:49:46,198 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 2798 mSDsluCounter, 4429 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2799 SdHoareTripleChecker+Valid, 4986 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:49:46,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2799 Valid, 4986 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 14:49:46,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83683 states. [2025-01-09 14:49:48,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83683 to 64851. [2025-01-09 14:49:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64851 states, 60154 states have (on average 1.5561226186122286) internal successors, (93607), 60322 states have internal predecessors, (93607), 4227 states have call successors, (4227), 469 states have call predecessors, (4227), 469 states have return successors, (4227), 4059 states have call predecessors, (4227), 4227 states have call successors, (4227) [2025-01-09 14:49:48,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64851 states to 64851 states and 102061 transitions. [2025-01-09 14:49:48,286 INFO L78 Accepts]: Start accepts. Automaton has 64851 states and 102061 transitions. Word has length 491 [2025-01-09 14:49:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:49:48,287 INFO L471 AbstractCegarLoop]: Abstraction has 64851 states and 102061 transitions. [2025-01-09 14:49:48,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 24.25) internal successors, (388), 16 states have internal predecessors, (388), 6 states have call successors, (201), 3 states have call predecessors, (201), 6 states have return successors, (201), 5 states have call predecessors, (201), 6 states have call successors, (201) [2025-01-09 14:49:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 64851 states and 102061 transitions. [2025-01-09 14:49:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-01-09 14:49:48,307 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:49:48,307 INFO L218 NwaCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:49:48,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:49:48,511 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 14:49:48,511 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:49:48,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:49:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -499473154, now seen corresponding path program 1 times [2025-01-09 14:49:48,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:49:48,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490403920] [2025-01-09 14:49:48,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:49:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:49:48,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-01-09 14:49:48,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-01-09 14:49:48,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:49:48,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat